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

%I A102424
%S A102424 1,1,2,3,5,7,9,12,16,20,25,30,36,43,50,58,66,75,84,94,104,114,124,135,
               145,
%T A102424 156,165,175,184,193,201,208,214,220,224,228,230,231,231,228,224,220,
%U A102424 214,208,201,193,184,175,165,156,145,135,124,114,104,94,84,75,66,58,50
%N A102424 Number of partitions of n with each part p <= 5 and each part's multiplicity 
               m <= 5.
%C A102424 There are only 76 nonzero terms.
%H A102424 Thomas Wieder, <a href="http://www.thomas-wieder.privat.t-online.de/default.html">
               Home Page</a>.
%H A102424 Thomas Wieder, <a href="http://homepages.tu-darmstadt.de/~wieder/">(Old) 
               Home Page</a>.
%e A102424 a(7)=12 because we can write 7=1+1+1+1+1+2, 1+1+1+2+2, 1+2+2+2, 1+1+1+1+3, 
               1+1+2+3, 2+2+3, 1+3+3, 1+1+1+4, 1+2+4, 3+4, 1+1+5, 2+5. Not allowed 
               are: 1+1+1+1+1+1+1, 16, 7.
%p A102424 g:=product(sum(z^(p*m),m=0..5),p=1..5): series(g,z=0,80);
%Y A102424 Cf. A102420 = number of partitions of integer n with exactly k = 5 parts 
               and each part p <= 5.
%Y A102424 Cf. A000041, A102420.
%Y A102424 Sequence in context: A039825 A126256 A062438 this_sequence A080000 A032459 
               A028870
%Y A102424 Adjacent sequences: A102421 A102422 A102423 this_sequence A102425 A102426 
               A102427
%K A102424 easy,nonn
%O A102424 0,3
%A A102424 Thomas Wieder (wieder.thomas(AT)t-online.de), Jan 09 2005
%E A102424 Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 15 2006

Search completed in 0.001 seconds