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!)
A238565 Number of partitions of 8^n into parts that are at most n. 2
0, 1, 33, 22102, 478968264, 400686586344699, 14330879421541116923943, 23444113544017670689348160755868, 1841159754991692001851990839259642586671980, 7197738918090981779157236361118960948634130123398244711 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015

CROSSREFS

Column k=8 of A238010.

Sequence in context: A232306 A092815 A230673 * A232456 A229932 A306723

Adjacent sequences:  A238562 A238563 A238564 * A238566 A238567 A238568

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Feb 28 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 October 27 23:46 EDT 2021. Contains 348305 sequences. (Running on oeis4.)