Integers with low Kolmogorov complexity

I found this cute sequence in the Online Encyclopedia of Integer Sequences:

A168650: Integers that can be generated with a C/C++ expression that is shorter than their decimal representation.

The "Kolmogorov complexity" of a string is the length of the minimal program which generates that string. In general, this is uncomputable, but we can find small examples through exhaustive search. The sequence A168650 attempts a practical measurement using a real programming language, C. (I don't think any C++ feature will change the results for small examples--- but, because they are different languages, the definition should be precise, particularly as to which version.)

Most of the short examples are not very interesting, because they use the floating-point notation.

However, the submitter did provide this cool graph:

Sources

The On-Line Encyclopedia of Integer Sequences, published electronically at https://oeis.org, October 27, 2018.

Inspired by this question on Quora: https://www.quora.com/Is-there-a-list-of-integer-numbers-with-a-low-Kolmogorov-complexity (and I wrote an answer there.)

Kolmogorov Complexity -- Wikipedia