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!)
A238566 Number of partitions of 9^n into parts that are at most n. 2
0, 1, 41, 44652, 1965803130, 4223556692359571, 490686876939553950148311, 3299362171812031624458362654344896, 1347816410652573760215295879527613786555869189, 34687845413783594101366282545316028561007822069601179170488 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

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

CROSSREFS

Column k=9 of A238010.

Sequence in context: A218377 A258488 A297052 * A241327 A206358 A222923

Adjacent sequences:  A238563 A238564 A238565 * A238567 A238568 A238569

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 23 00:24 EDT 2020. Contains 337962 sequences. (Running on oeis4.)