login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276019 n^2 * a(n) = (88*n^2 - 132*n + 54) * a(n-1) - 500*(2*n-3)^2 * a(n-2), with a(0)=1, a(1)=10. 2
1, 10, 230, 6500, 199750, 6366060, 204990300, 6539387400, 202432551750, 5897526329500, 151804596385780, 2807347223915000, -15232296765302500, -5584390420089725000, -416025902106681525000, -24002385182809425846000, -1235898175219724085176250, -59486502796252242452122500, -2731496764897242177292037500, -120874274801920384164027025000, -5181210157044172846922944311500 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Robert S. Maier, On Rationally Parametrized Modular Equations, arXiv:math/0611041 [math.NT], 2006.
FORMULA
n^2*a(n) = (88*n^2-132*n+54)*a(n-1) - 500*(2*n-3)^2*a(n-2), with a(0)=1, a(1)=10.
0 = 4*x*(x^2+22*x+125)*y'' + (8*x^2+132*x+500)*y' + (x+10)*y, where y(x) = A(x/-500).
EXAMPLE
A(x) = 1 + 10*x + 230*x^2 + 6500*x^3 + ... is the g.f.
PROG
(PARI)
seq(N) = {
a = vector(N); a[1] = 10; a[2] = 230;
for (n = 3, N, a[n] = ((88*n^2 - 132*n + 54)*a[n-1] - 500*(2*n-3)^2 * a[n-2])/n^2);
concat(1, a);
};
seq(20)
CROSSREFS
Sequence in context: A211079 A211084 A302095 * A004702 A027952 A056602
KEYWORD
sign
AUTHOR
Gheorghe Coserea, Aug 23 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:46 EDT 2024. Contains 371267 sequences. (Running on oeis4.)