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!)
A238560 Number of partitions of 3^n into parts that are at most n. 2
0, 1, 5, 75, 4410, 1366617, 2559274110, 31328639384771, 2625213100478051111, 1553872467564223628517240, 6655897240266476140036201639917, 210488414263886836416720847147423569801, 49987740079047684574220644720678455290986424137 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

FORMULA

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

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

EXAMPLE

a(2) = 5: 22221, 222111, 2211111, 21111111, 111111111.

CROSSREFS

Column k=3 of A238010.

Sequence in context: A034688 A238608 A132855 * A303125 A258784 A051481

Adjacent sequences:  A238557 A238558 A238559 * A238561 A238562 A238563

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 February 20 07:41 EST 2020. Contains 332069 sequences. (Running on oeis4.)