login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064682 a(n) = number of partitions of n^n into distinct parts. 0
1, 1, 2, 192, 11784471548, 49119584729121300101049137845273511977280 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..5.

FORMULA

a(n) = A000009(A000312(n)). - Michel Marcus, Jan 11 2015

MATHEMATICA

a[n_]:=PartitionsQ[n^n]; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 3!}]; lst (* Vladimir Joseph Stephan Orlovsky, Dec 03 2008 *)

PROG

(PARI) a(n) = polcoeff(prod(k=1, n, 1+x^k, 1+x*O(x^n)), n) for(n=0, 23, print(a(n^n)))

CROSSREFS

Cf. A000009.

Sequence in context: A265750 A174827 A260404 * A139949 A229017 A103429

Adjacent sequences:  A064679 A064680 A064681 * A064683 A064684 A064685

KEYWORD

nonn

AUTHOR

Jason Earls, Oct 10 2001

EXTENSIONS

Next term is 841043474026501008459...7883814176 (166 digits) - David Wasserman, Aug 01 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 15:59 EST 2020. Contains 332307 sequences. (Running on oeis4.)