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!)
A064682 a(n) = number of partitions of n^n into distinct parts. 4

%I #14 Dec 15 2017 17:35:41

%S 1,1,2,192,11784471548,49119584729121300101049137845273511977280

%N a(n) = number of partitions of n^n into distinct parts.

%F a(n) = A000009(A000312(n)). - _Michel Marcus_, Jan 11 2015

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

%o (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)))

%Y Cf. A000009.

%K nonn

%O 0,3

%A _Jason Earls_, Oct 10 2001

%E Next term is 841043474026501008459...7883814176 (166 digits) - _David Wasserman_, Aug 01 2002

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)