|
Search: id:A139634
|
|
|
| A139634 |
|
Binomial transform of [1, 10, 10, 10,...]. |
|
+0
7
|
|
| 1, 11, 31, 71, 151, 311, 631, 1271, 2551, 5111, 10231, 20471, 40951, 81911, 163831, 327671, 655351, 1310711, 2621431, 5242871, 10485751, 20971511, 41943031, 83886071, 167772151, 335544311, 671088631, 1342177271, 2684354551
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The binomial transform of [1, c, c, c,...] has the terms a(n)=1-c+c*2^(n-1) if the offset 1 is chosen. The o.g.f. of the a(n) is x{1+(c-2)x}/{(2x-1)(x-1)}. This applies to A139634 with c=10, to A139635 with c=11, to A139697 with c=12, to A139698 with c=25 and to A099003, A139700, A139701 accordingly. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 11 2008
|
|
FORMULA
|
A007318 * [1, 10, 10, 10,...].
|
|
EXAMPLE
|
a(4) = 71 = (1, 3, 3, 1) dot (1, 10, 10, 10) = (1 + 30 + 30 + 10).
|
|
MATHEMATICA
|
a=1; lst={a}; k=10; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 17 2008]
|
|
CROSSREFS
|
Sequence in context: A085715 A040973 A141884 this_sequence A124704 A089346 A038773
Adjacent sequences: A139631 A139632 A139633 this_sequence A139635 A139636 A139637
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 29 2008
|
|
EXTENSIONS
|
More terms and Mathematica program Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 17 2008
|
|
|
Search completed in 0.002 seconds
|
