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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 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

%I

%S 0,1,33,22102,478968264,400686586344699,14330879421541116923943,

%T 23444113544017670689348160755868,

%U 1841159754991692001851990839259642586671980,7197738918090981779157236361118960948634130123398244711

%N Number of partitions of 8^n into parts that are at most n.

%H Alois P. Heinz, <a href="/A238565/b238565.txt">Table of n, a(n) for n = 0..35</a>

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

%F a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015

%Y Column k=8 of A238010.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Feb 28 2014

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.

Last modified November 30 06:28 EST 2021. Contains 349419 sequences. (Running on oeis4.)