%I A005421 M0430
%S A005421 1,1,1,1,2,3,2,6,6,7,14,16,20,34,42,56,84,108,152,214,295,
%T A005421 398,569,763,1094,1475,2058,2878,3929,5493,7669,10501,14707,
%U A005421 20476,28226,39287,54817,75619,105584,146910,203294,283764,394437,547485,
               763821,1061367,1476067,2057708,2861449
%N A005421 Number of numbers of complexity n.
%D A005421 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005421 D. A. Rawsthorne, How many 1's are needed?, Fib. Quart. 27 (1989), 14-17.
%H A005421 Tim Peters, <a href="a005421.txt">Python program to compute this sequence</
               a>
%H A005421 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               IntegerComplexity.html">Integer Complexity</a>
%Y A005421 Cf. A005245 (complexity of n), A005520 (records).
%Y A005421 Sequence in context: A144176 A144175 A077418 this_sequence A158279 A153984 
               A025502
%Y A005421 Adjacent sequences: A005418 A005419 A005420 this_sequence A005422 A005423 
               A005424
%K A005421 nonn,nice
%O A005421 1,5
%A A005421 Simon Plouffe (simon.plouffe(AT)gmail.com)
%E A005421 More terms from Tim Peters (tim.one(AT)comcast.net), Nov 12 2004