|
%I #33 Sep 29 2020 04:20:23
%S 1,42,190569292,24061467864032622473692149727991,
%T 36167251325636293988820471890953695495016030339315650422081868605887952568754066420592310556052906916435144
%N Number of partitions of 10^n.
%C The next term a(5)=~2.749351*10^346 is too large to include.
%C Johansson computes the terms up to a(19). - _Charles R Greathouse IV_, Jul 09 2012
%H Robert G. Wilson v, <a href="/A070177/b070177.txt">Table of n, a(n) for n = 0..7</a>
%H Fredrik Johansson, <a href="http://arxiv.org/abs/1205.5991">Efficient implementation of the Hardy-Ramanujan-Rademacher formula</a>, arXiv:1205.5991 [math.NT], 2012, preprint; <a href="https://doi.org/10.1112/S1461157012001088">DOI</a>, LMS J. Comput. Math. 15 (2012) 341-359.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PartitionFunctionP.html">Partition Function P</a>
%F a(n) = A000041(A011557(n)). - _Michel Marcus_, Sep 29 2020
%t Table[ PartitionsP[10^n], {n, 0, 4}] (* _Robert G. Wilson v_, Nov 14 2005 *)
%o (PARI) a(n) = numbpart(10^n); \\ _Michel Marcus_, Oct 03 2014
%Y Cf. A000041, A011557.
%K nonn
%O 0,2
%A _Eric W. Weisstein_, Apr 24 2002
%E More terms from _Vladeta Jovovic_, May 03 2002
| 