This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A006644 #20 Jul 08 2025 00:45:20
%S A006644 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 A006644 40,41,42,43,47,49,53,57,58,59,60,62,64,66,68,70,72,76,77,78,79,83,85,
%U A006644 89,93,95,97,101,102,106,108,112,118,120,126,128,130,131,132
%N A006644 Indices of records in Landau's function A000793.
%H A006644 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 A006644 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 A006644 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 A006644 Cf. A000793, A002809.
%K A006644 nonn
%O A006644 1,2
%A A006644 _N. J. A. Sloane_