%I A145513
%S A145513 1,2,12,562,195812,515009562,10837901390812,1899421190329234562,
%T A145513 2851206628197445401265812,37421114946843687272702534859562,
%U A145513 4362395890943439751990308572939648140812
%N A145513 Number of partitions of 10^n into powers of 10.
%F A145513 See program.
%e A145513 a(1) = 2, because there are 2 partitions of 10^1 into powers of 10: 1+1+1+1+1+1+1+1+1+1, 
               10.
%p A145513 g:= proc(b,n,k) option remember; local t; if b<0 then 0 elif b=0 or n=0 
               or k<=1 then 1 elif b>=n then add (g(b-t, n, k) *binomial (n+1, t) 
               *(-1)^(t+1), t=1..n+1); else g(b-1, n, k) +g(b*k, n-1, k) fi end: 
               a:= n-> g(1,n,10): seq (a(n), n=0..13);
%Y A145513 Cf. 10th column of A145515, A007318.
%Y A145513 Sequence in context: A013173 A013147 A050643 this_sequence A002860 A108078 
               A052129
%Y A145513 Adjacent sequences: A145510 A145511 A145512 this_sequence A145514 A145515 
               A145516
%K A145513 nonn
%O A145513 0,2
%A A145513 Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 11 2008