|
Search: id:A135466
|
|
|
| A135466 |
|
a(n) = (2*n-8)^2*2^(n-3). |
|
+0 1
|
|
| 8, 9, 8, 4, 0, 16, 128, 576, 2048, 6400, 18432, 50176, 131072, 331776, 819200, 1982464, 4718592, 11075584, 25690112, 58982400, 134217728, 303038464, 679477248, 1514143744, 3355443200, 7398752256, 16240345088, 35500589056, 77309411328, 167772160000
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
Myerson, G. and van der Poorten, A. J., Some problems concerning recurrence sequences, Amer. Math. Monthly 102 (1995), no. 8, 698-705.
|
|
FORMULA
|
O.g.f.: -(8-39*x+50*x^2)/(-1+2*x)^3 . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 08 2008
|
|
CROSSREFS
|
Sequence in context: A011463 A073637 A019738 this_sequence A019873 A011010 A019606
Adjacent sequences: A135463 A135464 A135465 this_sequence A135467 A135468 A135469
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Feb 07 2008
|
|
|
Search completed in 0.002 seconds
|