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

 

Logo

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!)
A238567 Number of partitions of 10^n into parts that are at most n. 2
0, 1, 51, 83834, 6954866112, 34732639965323612, 11574681724845786651679939, 275575507062293332528670070330578043, 492095606182604983628979092635386202795929807572, 68346538155515186680097859376764556127526656338966443473179293 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

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

CROSSREFS

Column k=10 of A238010.

Sequence in context: A208405 A208412 A198904 * A198251 A135531 A038777

Adjacent sequences:  A238564 A238565 A238566 * A238568 A238569 A238570

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 December 4 15:14 EST 2021. Contains 349526 sequences. (Running on oeis4.)