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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238612 Number of partitions of n^7 into parts that are at most n. 2
1, 1, 65, 399675, 30569959880, 12940003469288602, 19900384510848921094632, 85980297709044488588773397089, 877979540384895591800176962368065072, 18720322073127387624828552135278902045913865, 759424638305250205001161810310150848799911916053194 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..60

FORMULA

a(n) = [x^(n^7)] Product_{j=1..n} 1/(1-x^j).

a(n) ~ exp(2*n) * n^(5*n-7) / (2*Pi). - Vaclav Kotesovec, May 25 2015

CROSSREFS

Column k=7 of A238016.

Sequence in context: A171706 A015072 A015039 * A185823 A035519 A238842

Adjacent sequences:  A238609 A238610 A238611 * A238613 A238614 A238615

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Mar 01 2014

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 January 17 12:36 EST 2020. Contains 330958 sequences. (Running on oeis4.)