Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Aug 24 2019 09:38:31
%S 0,2,3,4,5,7,8,9,10,12,14,15,16,17,19,23,25,27,28,29,30,32,34,36,38,
%T 40,41,42,43,47,49,53,57,58,59,60,62,64,66,68,70,72,76,77,78,79,83,85,
%U 89,93,95,97,101,102,106,108,112,118,120,126,128,130,131,132
%N Indices of records in Landau's function A000793.
%H Amiram Eldar, <a href="/A006644/b006644.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..3318 from Alois P. Heinz)
%H J.-L. Nicolas, <a href="http://www.numdam.org/item?id=BSMF_1969__97__129_0">Ordre maximum d'un élément du groupe de permutations et highly composite numbers</a>, Bull. Math. Soc. France, 97 (1969), 129-191.
%t b[n_, i_] := b[n, i] = Module[{p}, p = If[i<1, 1, Prime[i]]; If[n == 0 || i<1, 1, Max[b[n, i-1], Table[p^j*b[n-p^j, i-1], {j, 1, Log[p, n] // Floor}]]]]; order[n_] := b[n, If[n<8, 3, PrimePi[Ceiling[1.328*Sqrt[n*Log[n] // Floor]]]]]; Join[{0}, Position[Differences[Array[order, 133, 0]], _?Positive] // Flatten ] (* _Jean-François Alcover_, Mar 13 2014, after _Alois P. Heinz_ *)
%Y Cf. A000793, A002809.
%K nonn
%O 1,2
%A _N. J. A. Sloane_.