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!)
A281501 Number of partitions of n^3 into distinct parts. 1
1, 1, 6, 192, 16444, 3207086, 1258238720, 916112394270, 1168225267521350, 2496696209705056142, 8635565795744155161506, 46977052491046305327286932, 392416122247953159916295467008, 4931628582570689013431218105121792, 91603865924570978521516549662581412000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..117

Index entries for related partition-counting sequences

FORMULA

a(n) = [x^(n^3)] Product_{k>=1} (1 + x^k).

a(n) = A000009(A000578(n)).

a(n) ~ exp(Pi*n^(3/2)/sqrt(3))/(4*3^(1/4)*n^(9/4)).

EXAMPLE

a(2) = 6 because we have [8], [7, 1], [6, 2], [5, 3], [5, 2, 1] and [4, 3, 1].

MATHEMATICA

Table[PartitionsQ[n^3], {n, 0, 10}]

CROSSREFS

Cf. A000009, A000578, A072213, A072243, A128854.

Sequence in context: A232214 A012205 A156122 * A283884 A280552 A241137

Adjacent sequences:  A281498 A281499 A281500 * A281502 A281503 A281504

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, Jan 23 2017

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 March 5 11:27 EST 2021. Contains 341823 sequences. (Running on oeis4.)