|
Search: id:A131130
|
|
|
| A131130 |
|
Binomial transform of [1,1,7,1,7,1,7,1,...]. |
|
+0
7
|
|
| 1, 2, 10, 26, 58, 122, 250, 506, 1018, 2042, 4090, 8186, 16378, 32762, 65530, 131066, 262138, 524282, 1048570, 2097146, 4194298, 8388602, 16777210, 33554426, 67108858, 134217722, 268435450, 536870906, 1073741818, 2147483642
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A095121 = binomial transform of [1, 1, 3, 1, 3, 1, 3, 1,...]. A131128 = binomial transform of [1, 1, 5, 1, 5, 1, 5, 1,...].
|
|
FORMULA
|
Row sums of triangle A131131.
a(n)=4*2^n - 6 for n>=1; a(0)=1.
a(n)=3*a(n-1)-2*a(n-2), n>2 ; a(0)=1, a(1)=2, a(2)=10 . G.f.: (1-x+6x^2)/(1-3x+2x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 04 2009]
a(n)=2*a(n-1)+6 for n>1, a(0)=1, a(1)=2. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 25 2009]
|
|
MAPLE
|
1, seq(4*2^n-6, n = 1 .. 30);
|
|
MATHEMATICA
|
a=2; lst={1, a}; k=8; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 16 2008]
|
|
CROSSREFS
|
Cf. A131131, A131128, A095121.
Sequence in context: A069894 A045605 A009307 this_sequence A099969 A025589 A084182
Adjacent sequences: A131127 A131128 A131129 this_sequence A131131 A131132 A131133
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 16 2007
|
|
EXTENSIONS
|
Edited by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 12 2007
|
|
|
Search completed in 0.002 seconds
|
