|
Search: id:A005421
|
|
|
| A005421 |
|
Number of numbers of complexity n.
(Formerly M0430)
|
|
+0
9
|
|
| 1, 1, 1, 1, 2, 3, 2, 6, 6, 7, 14, 16, 20, 34, 42, 56, 84, 108, 152, 214, 295, 398, 569, 763, 1094, 1475, 2058, 2878, 3929, 5493, 7669, 10501, 14707, 20476, 28226, 39287, 54817, 75619, 105584, 146910, 203294, 283764, 394437, 547485, 763821, 1061367, 1476067, 2057708, 2861449
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
D. A. Rawsthorne, How many 1's are needed?, Fib. Quart. 27 (1989), 14-17.
|
|
LINKS
|
Tim Peters, Python program to compute this sequence
Eric Weisstein's World of Mathematics, Integer Complexity
|
|
CROSSREFS
|
Cf. A005245 (complexity of n), A005520 (records).
Sequence in context: A144176 A144175 A077418 this_sequence A158279 A153984 A025502
Adjacent sequences: A005418 A005419 A005420 this_sequence A005422 A005423 A005424
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
EXTENSIONS
|
More terms from Tim Peters (tim.one(AT)comcast.net), Nov 12 2004
|
|
|
Search completed in 0.002 seconds
|
