|
| |
|
|
A113251
|
|
Corresponds to m = 5 in a family of 4th order linear recurrence sequences given by a(m,n) = m^4*a(n-4) + (2*m)^2*a(n-3) - 4*a(m-1), a(m,0) = -1, a(m,1) = 4, a(m,2) = -13 + 6*(m-1) + 3*(m-1)^2, a(m,3) = (-8+m^2)^2.
|
|
7
| |
|
|
-1, 4, 59, 289, -1381, 13924, 10079, 2209, 520439, 7628644, -23994301, 149401729, 490531859, 406344964, -1681645081, 149155846849, -249406479121, 1083427010884, 9530848465739, 30158362505569, -168169798384501, 2302905921914404, -239007146013841, 2988025311585889
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Conjecture: a(m, 2*n+1) is a perfect square for all m,n (see A113249),
|
|
|
FORMULA
| G.f. (-1+75*x^2+625*x^3)/((5*x+1)*(1-5*x)*(25*x^2+4*x+1))
|
|
|
MAPLE
| with(gfun): seriestolist(series((-1+75*x^2+625*x^3)/((5*x+1)*(1-5*x)*(25*x^2+4*x+1)), x=0, 25));
|
|
|
CROSSREFS
| Cf. A000302, A097948, A056450, A113249, A113250, A113252, A113253, A113254, A113255, A113256.
Sequence in context: A198511 A200048 A037066 * A183462 A093597 A199107
Adjacent sequences: A113248 A113249 A113250 * A113252 A113253 A113254
|
|
|
KEYWORD
| easy,sign
|
|
|
AUTHOR
| Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Nov 18 2005
|
| |
|
|
