|
Search: id:A133212
|
|
|
| A133212 |
|
a(n) = 4a(n-1)-6a(n-2)+ 4 a(n-3), n > 3; a(0) = 1, a(1) = 4, a(2) = 12, a(3) = 32. |
|
+0
2
|
|
| 1, 4, 12, 32, 72, 144, 272, 512, 992, 1984, 4032, 8192, 16512, 33024, 65792, 131072, 261632, 523264, 1047552, 2097152, 4196352, 8392704, 16781312, 33554432, 67100672, 134201344, 268419072, 536870912, 1073774592, 2147549184
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Conjecture: a(n)=2*A038503(n+3) if n>0. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2007
|
|
FORMULA
|
Sequence is identical to its fourth differences.
G.f.: -(1+2*x^2)/((2*x-1)*(2*x^2-2*x+1)). a(n) = -2*(-1)^n*A009116(n)+3*2^n. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 18 2007
|
|
MAPLE
|
A133212 := proc(n) option remember ; if n <= 3 then op(n+1, [1, 4, 12, 32]) ; else 4*A133212(n-1)-6*A133212(n-2)+4*A133212(n-3) ; fi ; end: seq(A133212(n), n=0..50) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2007
|
|
CROSSREFS
|
Cf. A009116, A099087.
Adjacent sequences: A133209 A133210 A133211 this_sequence A133213 A133214 A133215
Sequence in context: A028921 A028922 A066150 this_sequence A127811 A138517 A001934
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Paul Curtz (bpcrtz(AT)free.fr), Oct 11 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2007
|
|
|
Search completed in 0.002 seconds
|
