The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206531 a(n) = (2(n+1)(2n+1)-1) * a(n-1) + 2n(2n-1) * a(n-2), a(0)=0, a(1)=2. 2
 0, 2, 58, 3250, 292498, 38609738, 7026972314, 1686473355362, 516060846740770, 196103121761492602, 90599642253809582122, 50011002524102889331346, 32507151640666878065374898, 24575406640344159817423422890 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The numerators of the fractions limiting to the value of A206533. REFERENCES E. W. Cheney, Introduction to Approximation Theory, McGraw-Hill, Inc.,1966. LINKS FORMULA a(n) = A082108*a(n-1) + A002939*a(n-2), a(0) = 0, a(1) = 2. MATHEMATICA RecurrenceTable[{a[n]==(2(n+1)(2n+1)-1)a[n-1]+2n(2n-1)a[n-2], a[0]==0, a[1]==2}, a, {n, 15}] CROSSREFS Cf. A002939, A082108, A206532, A206533. Sequence in context: A115610 A341082 A191798 * A290306 A113635 A136095 Adjacent sequences:  A206528 A206529 A206530 * A206532 A206533 A206534 KEYWORD nonn AUTHOR Seiichi Kirikami, Feb 11 2012 STATUS approved

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

Last modified September 26 06:16 EDT 2021. Contains 347664 sequences. (Running on oeis4.)