login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072213 Number of partitions of n^2. 8
1, 1, 5, 30, 231, 1958, 17977, 173525, 1741630, 18004327, 190569292, 2056148051, 22540654445, 250438925115, 2814570987591, 31946390696157, 365749566870782, 4219388528587095, 49005643635237875, 572612058898037559 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n) = A000041(n^2).

MAPLE

A072213 := proc(n) combinat[numbpart](n^2) ; end proc:

seq(A072213(n), n=0..10) ; # R. J. Mathar, Jan 24 2011

MATHEMATICA

Table[ PartitionsP[n^2], {n, 1, 20}]

PROG

(PARI) a(n)=numbpart(n^2)

(PARI) a(n)=polcoeff(1/eta(x), n^2, x)

(Other) sage: [number_of_partitions(n^2)for n in xrange(0, 26)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 26 2009]

CROSSREFS

Cf. A000041, A000290.

A161407, A161408 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2009]

Sequence in context: A167892 A144498 A201368 * A199131 A052172 A058783

Adjacent sequences:  A072210 A072211 A072212 * A072214 A072215 A072216

KEYWORD

nonn

AUTHOR

Jeff Burch (gburch(AT)erols.com), Jul 03 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:53 EST 2012. Contains 205570 sequences.