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!)
 A238562 Number of partitions of 5^n into parts that are at most n. 2
 0, 1, 13, 1365, 1736385, 33432635477, 10815459920194632, 62725487942251841319705, 6831392910998237157682785667015, 14474273684384810126076369987535894403747, 613458701796516369003780850311157775345255117642867 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..40 FORMULA a(n) = [x^(5^n)] Product_{j=1..n} 1/(1-x^j). a(n) ~ 5^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015 EXAMPLE a(2) = 13: 2222222222221, 22222222222111, 222222222211111, 2222222221111111, 22222222111111111, 222222211111111111, 2222221111111111111, 22222111111111111111, 222211111111111111111, 2221111111111111111111, 22111111111111111111111, 211111111111111111111111, 1111111111111111111111111. CROSSREFS Column k=5 of A238010. Sequence in context: A221690 A197630 A222017 * A196966 A203369 A197097 Adjacent sequences:  A238559 A238560 A238561 * A238563 A238564 A238565 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.

Last modified December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)