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!)
A072215 a(0) = 4; for n >= 0, a(n+1) = number of partitions of a(n). 2
4, 5, 7, 15, 176, 476715857290 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(6) is too large to include (even in a b-file).
a(6) = 26680 54494 90278 28685 82404 ... {769101 digits} ... 72432 87250 16775 65100 60652. - Robert G. Wilson v, Sep 30 2009
LINKS
MAPLE
a:= n-> `if`(n=0, 4, combinat[numbpart](a(n-1))):
seq(a(n), n=0..5); # Alois P. Heinz, Apr 05 2021
MATHEMATICA
NestList[PartitionsP, 4, 5]
PROG
(Python)
from itertools import accumulate
from sympy.ntheory import npartitions
def f(an, _): return npartitions(an)
print(list(accumulate([4]*6, f))) # Michael S. Branicky, Apr 05 2021
CROSSREFS
Sequence in context: A069575 A250182 A358701 * A106170 A353246 A281991
KEYWORD
nonn
AUTHOR
Jeff Burch, Jul 04 2002
EXTENSIONS
Edited by N. J. A. Sloane, May 05 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 March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)