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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070177 Number of partitions of 10^n. 12
 1, 42, 190569292, 24061467864032622473692149727991, 36167251325636293988820471890953695495016030339315650422081868605887952568754066420592310556052906916435144 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The next term a(5)=~2.749351*10^346 is too large to include. Johansson computes the terms up to a(19). - Charles R Greathouse IV, Jul 09 2012 LINKS Robert G. Wilson v, Table of n, a(n) for n = 0..7 Fredrik Johansson, Efficient implementation of the Hardy-Ramanujan-Rademacher formula, arXiv:1205.5991 [math.NT], 2012, preprint; DOI, LMS J. Comput. Math. 15 (2012) 341-359. Eric Weisstein's World of Mathematics, Partition Function P FORMULA a(n) = A000041(A011557(n)). - Michel Marcus, Sep 29 2020 MATHEMATICA Table[ PartitionsP[10^n], {n, 0, 4}] (* Robert G. Wilson v, Nov 14 2005 *) PROG (PARI) a(n) = numbpart(10^n); \\ Michel Marcus, Oct 03 2014 CROSSREFS Cf. A000041, A011557. Sequence in context: A147687 A152508 A238637 * A173866 A291871 A114786 Adjacent sequences:  A070174 A070175 A070176 * A070178 A070179 A070180 KEYWORD nonn AUTHOR Eric W. Weisstein, Apr 24 2002 EXTENSIONS More terms from Vladeta Jovovic, May 03 2002 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 October 20 15:58 EDT 2020. Contains 337905 sequences. (Running on oeis4.)