A133374 Difference between largest number of complexity n in the sense of A005245 and smallest number of complexity n in the sense of A005245.

0, 0, 0, 0, 1, 2, 2, 7, 10, 14, 31, 40, 61, 103, 154, 217, 319, 550, 709, 1111, 1720, 2233, 3655, 5338, 7310, 11683, 16804, 22477, 35083, 52750, 68653, 106291, 161860, 214597, 320695, 486244, 652549, 981235, 1495324, 1962505, 2984647, 4541086

Offset

1,6

Comments

Complexity of n: number of 1's required to build n using + and *. The complexity of a number has been defined in several different ways by different authors. See the Index to the OEIS for other definitions.

Links

Janis Iraids, Table of n, a(n) for n = 1..89

Eric Weisstein's World of Mathematics, Integer Complexity

Formula

a(n) = A000792(n) - A005520(n).

Example

n A000792(n)-A005520(n) = a(n)
1 1 - 1 = 0.
2 2 - 2 = 0.
3 3 - 3 = 0.
4 4 - 4 = 0.
5 6 - 5 = 1.
6 9 - 7 = 2.
7 12 - 10 = 2.
8 18 - 11 = 7.
9 27 - 17 = 10.
10 36 - 22 = 14.
11 54 - 23 = 31.
12 81 - 41 = 40.
13 108 - 47 = 61.
14 162 - 59 = 103.
15 243 - 89 = 154.
16 324 - 107 = 217.
17 486 - 167 = 319.
18 729 - 179 = 550.
19 972 - 263 = 709.
20 1458 - 347 = 1111. etc.

Crossrefs

Cf. A000792, A005245, A005520, A133344.

Sequence in context: A275282 A307633 A101372 * A267446 A054226 A000024

Adjacent sequences: A133371 A133372 A133373 * A133375 A133376 A133377

Keyword

nonn

Author

Jonathan Vos Post, Oct 28 2007

Extensions

Corrected and extended by Janis Iraids, Apr 20 2011

Status

approved