|
Search: id:A125588
|
|
|
| A125588 |
|
a(0) = 10; for n>0, a(n) is determined by the rule that the concatenation of the leading terms of the difference triangle is the same as the concatenation of the digits of the sequence. |
|
+0
4
|
|
| 10, 11, 13, 17, 27, 51, 109, 250, 587, 1371, 3143, 7029, 15280, 32220, 65893, 131006, 254496, 486708, 924739, 1761887, 3392146, 6629144, 13161343, 26494654, 53903114, 110468906, 227450346, 469578760, 970646691, 2006230740, 4141064989, 8525021595
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(0) = 10; binomial transform of sequence gives successive digits of sequence.
|
|
LINKS
|
Zak Seidov, Table of n, a(n) for n = 0..199.
N. J. A. Sloane, Transforms
|
|
EXAMPLE
|
Triangle of successive differences begins:
10...11...13...17....27....51....109...250....
...1....2....4....10....24....58....141
......1....2....6....14....34.....83
........1....4.....8....20....49
...........3....4....12....29
.............1.....8....17
................7.....9
...................1
|
|
CROSSREFS
|
Cf. A125591, A125003.
Sequence in context: A121296 A121265 A045986 this_sequence A095038 A085186 A062844
Adjacent sequences: A125585 A125586 A125587 this_sequence A125589 A125590 A125591
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Eric Angelini (Eric.Angelini(AT)kntv.be), Jan 06 2007
|
|
|
Search completed in 0.002 seconds
|
