%I A102462
%S A102462 1,1,1,2,3,4,6,12,20,30,60,105,168,280,504,840,1512,2520,5040,9240,15840,
%T A102462 27720,55440,102960,180180,360360,675675,1201200,2162160,4084080,
%U A102462 7351344,12697776,24504480,46558512,84651840,155195040,296281440
%N A102462 Max{ k!/(a(1)!*a(2)!*..*a(n)!) : a(1)+2*a(2)+3*a(3)+..+n*a(n) = n, a(1)+a(2)+..+a(n) 
               = k }.
%C A102462 a(n) is the greatest number in row n of A048996 and in row n of A072811. 
               Thus a(n) is the greatest number of compositions (permutations) obtainable 
               from some partition of n. Example: a(7)=12 is the greatest number 
               of compositions from some partition of 7, specifically, the partition 
               {3,2,1,1}. - Clark Kimberling (ck6(AT)evansville.edu), Dec 24 2006
%C A102462 The partition(s) giving this optimum is always one where #{parts equal 
               to i} >= #{parts equal to j} if i <= j. These partitions are counted 
               in A007294. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), 
               Apr 08 2008
%Y A102462 Cf. A059171, A102356, A048992, A072811.
%Y A102462 Sequence in context: A118651 A129297 A018343 this_sequence A018369 A078495 
               A161701
%Y A102462 Adjacent sequences: A102459 A102460 A102461 this_sequence A102463 A102464 
               A102465
%K A102462 nonn
%O A102462 0,4
%A A102462 Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 23 2005