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!)
A129440 a(0)=0, a(1)=1, a(2)=5 and for n>2: a(n) = a(n-1)*(a(n-1) + 1)*(2*a(n-1) + 1)/6. 3
0, 1, 5, 55, 56980, 61667666167030, 78172010815921069181209893626754427513955 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A000330(if n<=2 then n else a(n)).
a(n) ~ sqrt(3) * c^(3^n), where c = 1.13701835838072682283814038264701129587627956851233106833915157... . - Vaclav Kotesovec, Dec 17 2014
MATHEMATICA
Flatten[{0, 1, RecurrenceTable[{a[2] == 5, a[n] == a[n-1]*(a[n-1] + 1)*(2*a[n-1] + 1)/6}, a[n], {n, 8}]}] (* Vaclav Kotesovec, Dec 17 2014 *)
Join[{0, 1}, NestList[(#(#+1)(2#+1))/6&, 5, 5]] (* Harvey P. Dale, Sep 13 2022 *)
PROG
(Magma) [0, 1] cat [n le 1 select 5 else Self(n-1)*(Self(n-1)+1)*(2*Self(n-1)+1)/6: n in [1..8]]; // G. C. Greubel, Feb 06 2024
(SageMath)
def a(n): # a = A129440
if n<3: return (0, 1, 5)[n]
else: return a(n-1)*(a(n-1)+1)*(2*a(n-1)+1)/6
[a(n) for n in range(9)] # G. C. Greubel, Feb 06 2024
CROSSREFS
Sequence in context: A063855 A081785 A144996 * A045729 A067515 A289259
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 15 2007
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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)