cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A008928 #32 Apr 30 2025 09:11:13
%S A008928 1,1,1,2,3,6,10,21,38,77,144,293,563,1131,2205,4434,8711,17466,34506,
%T A008928 69169,137247,274677,546081,1093217,2177556,4356756,8688370,17381926,
%U A008928 34691608,69394626,138578144,277197191,553794526,1107654097,2213527055,4427345544,8849519773
%N A008928 Number of increasing sequences of addition chain type with maximal element n.
%C A008928 This sequence counts all addition chains for n. - _David W. Wilson_, Apr 01 2006
%C A008928 In other words, a(n) = the number of increasing addition chains ending in n. - _Don Reble_, Apr 09 2006
%H A008928 Martin Fuller, <a href="/A008928/b008928.txt">Table of n, a(n) for n = 1..64</a>
%H A008928 Don Reble, <a href="/A008928/a008928.py.txt">Python program</a>
%H A008928 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 A008928 Cf. A008927, A079301, A008933.
%K A008928 nonn
%O A008928 1,4
%A A008928 Mauro Torelli (torelli(AT)hermes.mc.dsi.unimi.it)
%E A008928 More terms from _David W. Wilson_, Apr 01 2006
%E A008928 More terms from _Don Reble_, Apr 09 2006