|
Search: id:A059734
|
|
|
| A059734 |
|
Carryless 11^n base 10; a(n) is carryless sum of 10*a(n-1) and a(n-1). |
|
+0
1
|
|
| 1, 11, 121, 1331, 14641, 150051, 1650561, 17155171, 188606881, 1964664691, 10500200501, 115502205511, 1260524250621, 13865766756831, 141412323214141, 1555535555355551, 16000880008800061, 176008680086800671
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(n)=Sum[Mod[Binomial[n, m], 10]*10^m, {m, 0, n}]. - Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 14 2008
|
|
EXAMPLE
|
a(7)=17155171 since a(6)=1650561 and digits of a(7) are sum mod 10 of 1, 6+1=7, 5+6=1, 0+5=5, 5+0=5, 6+5=1, 1+6=7 and 1.
|
|
MATHEMATICA
|
Table[Sum[Mod[Binomial[n, m], 10]*10^m, {m, 0, n}], {n, 0, 30}] - Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 14 2008
|
|
CROSSREFS
|
Cf. A004520.
Cf. A006940.
Sequence in context: A007907 A088113 A045587 this_sequence A045582 A001020 A055479
Adjacent sequences: A059731 A059732 A059733 this_sequence A059735 A059736 A059737
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Feb 20 2001
|
|
|
Search completed in 0.002 seconds
|
