|
%I #15 Jul 10 2021 16:14:44
%S 1,14,33,32,91,141,213,212,213,3090,3093,3090,3090,3090,38405,38404,
%T 3090,3090,38401,38400,294581,294581,39569681,5571498,68780189,294577,
%U 68780189,53758490,92636277,456742389,1176172581,880346227,3953000577,13821836609,948481781,948481780,948481781,5332819926,35398246981,35398246979
%N a(n) is the least number k such that the sum of the n Moebius function values beginning at k reaches the maximum value A083544(n).
%e For n = 2, the 14 sums are 0, -2, -1, -1, 0, 0, -1, 0, 1, 0, -1, -1, 0, 2.
%t mu = Table[MoebiusMu[i], {i, 1000000}]; t = Table[s = Total /@ Partition[mu, n, 1]; mx = Max[s]; pos = Position[s, mx, 1, 1][[1, 1]]; {mx, pos}, {n, 22}]; Transpose[t][[2]]
%Y Cf. A008683 (Moebius function), A083544 (maximum values of sums).
%K nonn,hard,more
%O 1,2
%A _T. D. Noe_, May 07 2013
%E a(23)-a(24) added by _T. D. Noe_, May 08 2013
%E More terms from _Don Reble_, Apr 21 2021
|
