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!)
A206531 a(n) = (2*(n+1)*(2*n+1)-1)*a(n-1) + 2*n*(2*n-1)*a(n-2), a(0)=0, a(1)=2. 3
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(n)*a(n-1) + A002939(n)*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}]
PROG
(Magma) [n le 2 select 2*(n-1) else (2*n*(2*n-1)-1)*Self(n-1) + 2*(n-1)*(2*n-3)*Self(n-2): n in [1..31]]; // G. C. Greubel, Dec 21 2022
(SageMath)
@CachedFunction
def a(n): # a = A206531
if (n<2): return 2*n
else: return (2*(n+1)*(2*n+1)-1)*a(n-1) + 2*n*(2*n-1)*a(n-2)
[a(n) for n in range(31)] # G. C. Greubel, Dec 21 2022
CROSSREFS
Sequence in context: A115610 A341082 A191798 * A290306 A113635 A136095
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)