|
Search: id:A008928
|
|
|
| A008928 |
|
Number of increasing sequences of addition chain type with maximal element n. |
|
+0
4
|
|
| 1, 1, 1, 2, 3, 6, 10, 21, 38, 77, 144, 293, 563, 1131, 2205, 4434, 8711, 17466, 34506, 69169, 137247, 274677, 546081, 1093217, 2177556, 4356756, 8688370, 17381926, 34691608, 69394626, 138578144, 277197191, 553794526, 1107654097, 2213527055
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
This sequence counts all addition chains for n. - David W. Wilson (davidwwilson(AT)comcast.net), Apr 01 2006
In other words, a(n) = the number of increasing addition chains ending in n. - Don Reble (djr(AT)nk.ca), Apr 09 2006
|
|
REFERENCES
|
M. Torelli, Increasing integer sequences and Goldbach's conjecture, preprint, 1996.
|
|
LINKS
|
Don Reble, Python program
|
|
CROSSREFS
|
Cf. A008927, A079301, A008933.
Sequence in context: A047111 A106741 A068991 this_sequence A124343 A032291 A063687
Adjacent sequences: A008925 A008926 A008927 this_sequence A008929 A008930 A008931
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
torelli(AT)hermes.mc.dsi.unimi.it (Mauro Torelli)
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Apr 01 2006
More terms from Don Reble (djr(AT)nk.ca), Apr 09 2006
|
|
|
Search completed in 0.002 seconds
|
