|
|
A072215
|
|
a(0) = 4; for n >= 0, a(n+1) = number of partitions of a(n).
|
|
2
|
|
|
|
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))):
|
|
MATHEMATICA
|
NestList[PartitionsP, 4, 5]
|
|
PROG
|
(Python)
from itertools import accumulate
from sympy.ntheory import npartitions
def f(an, _): return npartitions(an)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|