Search: id:A033630
Results 1-1 of 1 results found.

%I A033630
%S A033630 1,1,1,1,1,2,1,1,1,1,1,3,1,1,1,1,1,3,1,2,1,1,1,6,1,1,1,2,1,4,1,1,1,1,1,
%T A033630 8,1,1,1,4,1,3,1,1,1,1,1,11,1,1,1,1,1,4,1,3,1,1,1,35,1,1,1,1,1,3,1,1,1,
%U A033630 1,1,32,1,1,1,1,1,2,1,7,1,1,1,26,1,1,1,2,1,24,1,1,1,1,1,22,1,1,1,3
%N A033630 Number of partitions of n into distinct divisors of n.
%C A033630 a(A005100(n)) = 1; a(A005835(n)) > 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Mar 02 2007
%H A033630 T. D. Noe, <a href="b033630.txt">Table of n, a(n) for n=1..1000</a>
%e A033630 a(12)=3 because we have [12],[6,4,2] and [6,3,2,1].
%p A033630 with(numtheory): a:=proc(n) local div, g, gser: div:=divisors(n): g:=product(1+x^div[j],
               j=1..tau(n)): gser:=series(g,x=0,105): coeff(gser,x^n): end: seq(a(n),
               n=1..100); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 30 2006
%t A033630 Table[ SeriesCoefficient[ Series[ Times@@((1+z^#)& /@ Divisors[ n ]), 
               {z, 0, n} ], n ], {n, 512} ] - from W. Meeussen (wouter.meeussen(AT)pandora.be)
%Y A033630 Cf. A018818.
%Y A033630 a(n) = A065205(n) + 1.
%Y A033630 Sequence in context: A046214 A115413 A069283 this_sequence A101446 A062760 
               A014649
%Y A033630 Adjacent sequences: A033627 A033628 A033629 this_sequence A033631 A033632 
               A033633
%K A033630 nonn
%O A033630 1,6
%A A033630 Marc LeBrun (mlb(AT)well.com)
%E A033630 More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Apr 21 2003

Search completed in 0.002 seconds