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

%I A098859
%S A098859 1,1,2,2,4,5,7,10,13,15,21,28,31,45,55,62,82,105,116,153,172,208,251,
%T A098859 312,341,431,492,588,676,826,905,1120,1249,1475,1676,2003,2187,2625,
%U A098859 2922,3409,3810,4481,4910,5792,6382,7407,8186,9527,10434
%N A098859 Number of partitions of n into parts each of which is used a different 
               number of times.
%e A098859 a(6)=7 because 6= 4+1+1= 3+3= 3+1+1+1= 2+2+2= 2+1+1+1+1= 1+1+1+1+1+1. 
               Four unrestricted partitions of 6 are not counted by a(6): 5+1, 4+2, 
               3+2+1 because at least two different summands are each used once; 
               2+2+1+1 because each summand is used twice.
%Y A098859 Sequence in context: A135833 A137200 A026930 this_sequence A034398 A027069 
               A166515
%Y A098859 Adjacent sequences: A098856 A098857 A098858 this_sequence A098860 A098861 
               A098862
%K A098859 nonn
%O A098859 0,3
%A A098859 David S Newman (DavidSNewman(AT)hotmail.com), Oct 11 2004
%E A098859 Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 
               22 2004

Search completed in 0.001 seconds