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

%I A119907
%S A119907 0,0,0,0,1,1,3,4,7,9,15,18,27,34,47,58,79,96,127,155,199,242,308,371,
%T A119907 465,561,694,833,1024,1223,1491,1778,2150,2556,3076,3642,4359,5151,6133,
%U A119907 7225,8570,10066,11892,13937,16401,19173,22495,26228,30676,35692,41620
%N A119907 Number of partitions of n such that if k is the largest part, then k-2 
               occurs as a part.
%F A119907 G.f. for number of partitions of n such that if k is the largest part, 
               then k-m occurs as a part is Sum(x^(2*i-m)/Product(1-x^j,j=1..i),
               i=m+1..infinity).
%Y A119907 Cf. A083751.
%Y A119907 Sequence in context: A147953 A163468 A069183 this_sequence A158911 A086772 
               A086336
%Y A119907 Adjacent sequences: A119904 A119905 A119906 this_sequence A119908 A119909 
               A119910
%K A119907 easy,nonn
%O A119907 0,7
%A A119907 Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 02 2006
%E A119907 More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), 
               Aug 14 2006

Search completed in 0.001 seconds