%I A026810
%S A026810 0,0,0,0,1,1,2,3,5,6,9,11,15,18,23,27,34,39,47,54,64,72,84,94,108,120,
%T A026810 136,150,169,185,206,225,249,270,297,321,351,378,411,441,478,511,551,
%U A026810 588,632,672,720,764,816,864,920,972,1033,1089,1154,1215,1285,1350
%N A026810 Number of partitions of n in which the greatest part is 4.
%C A026810 Also number of partitions of n into exactly 4 parts.
%D A026810 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 
               3rd ed., Oxford Univ. Press, 1954, p. 275.
%F A026810 G.f.: x^4/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).
%t A026810 Table[ Length[ Select[ Partitions[n], First[ # ] == 4 & ]], {n, 1, 60} 
               ]
%Y A026810 Essentially same as A001400.
%Y A026810 Cf. A026811, A026812, A026813, A026814, A026815, A026816.
%Y A026810 Sequence in context: A123399 A104738 A028309 this_sequence A001400 A008773 
               A008772
%Y A026810 Adjacent sequences: A026807 A026808 A026809 this_sequence A026811 A026812 
               A026813
%K A026810 nonn
%O A026810 1,7
%A A026810 Clark Kimberling (ck6(AT)evansville.edu)
%E A026810 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 11 2002