|
%I #10 Feb 16 2013 11:11:33
%S 1,1,1,1,3,1,5,5,8,15,13,33,49,35,49,73,107,143,211,293,398,505,510,
%T 685,710,948,740,994,2033,1735,2266,1780,2333,4653,5923,7311,9213,
%U 7683,9719,17878,14703,19072,22814,28266,34878,42876,52390
%N Consider the partitions of n in reverse lexicographic ordering (A080577), a(n) is the position of the partition of n which has the maximum LCM. See A000793.
%C As n grows, a(n)/P(n) -> ~1/3, where P(n) is A000041(n).
%H Robert G. Wilson v, <a href="/A213952/b213952.txt">Table of n, a(n) for n = 1..84</a>
%e a(5) = 3 because of the seven partitions of 5, {{5}, {4, 1}, {3, 2}, {3, 1, 1}, {2, 2, 1}, {2, 1, 1, 1}, {1, 1, 1, 1, 1}}; the LCMs of each are: {5, 4, 6, 3, 2, 2, 1}. The third one is the maximum.
%t f[n_] := Block[{lst = Apply[LCM, IntegerPartitions@ n, 1]}, Flatten[ Position[ lst, Max@ lst, 1, 1], 1][[1]]]; Array[f, 47]
%Y Cf. A000793, A080577, A000041.
%K nonn
%O 1,5
%A _Robert G. Wilson v_, Jul 04 2012
|
