A008928 - OEIS

%I #20 Jul 12 2018 08:47:03

%S 1,1,1,2,3,6,10,21,38,77,144,293,563,1131,2205,4434,8711,17466,34506,

%T 69169,137247,274677,546081,1093217,2177556,4356756,8688370,17381926,

%U 34691608,69394626,138578144,277197191,553794526,1107654097,2213527055

%N Number of increasing sequences of addition chain type with maximal element n.

%C This sequence counts all addition chains for n. - _David W. Wilson_, Apr 01 2006

%C In other words, a(n) = the number of increasing addition chains ending in n. - _Don Reble_, Apr 09 2006

%H Don Reble, <a href="/A008928/a008928.py.txt">Python program</a>

%H Mauro Torelli, <a href="http://www.numdam.org/item?id=ITA_2006__40_2_107_0">Increasing integer sequences and Goldbach's conjecture</a>, RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, 40:2 (2006), pp. 107-121.

%Y Cf. A008927, A079301, A008933.

%K nonn

%O 1,4

%A Mauro Torelli (torelli(AT)hermes.mc.dsi.unimi.it)

%E More terms from _David W. Wilson_, Apr 01 2006

%E More terms from _Don Reble_, Apr 09 2006