cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 2, 192, 11784471548, 49119584729121300101049137845273511977280
Offset: 0

Views

Author

Jason Earls, Oct 10 2001

Keywords

Crossrefs

Cf. A000009.

Programs

  • Mathematica
    a[n_]:=PartitionsQ[n^n];lst={};Do[AppendTo[lst, a[n]], {n, 0, 3!}];lst (* Vladimir Joseph Stephan Orlovsky, Dec 03 2008 *)
  • 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)))

Formula

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

Extensions

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