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 A279541 #10 Nov 27 2017 00:38:05
%S A279541 1,5,25,35,175,385,1225,1925,9625,13475,48125,55825,148225,279125,
%T A279541 390775,1395625,1730575,4298525,8652875,12114025,43264375,60570125,
%U A279541 133254275,302850625,423990875,642043325,2119954375
%N A279541 Indices of records in A192013: Sum_{d|n} Kronecker(-6, d).
%H A279541 Charles R Greathouse IV, <a href="/A279541/b279541.txt">Table of n, a(n) for n = 1..400</a>
%o A279541 (PARI) smooth(P:vec, lim)=my(v=List([1]), nxt=vector(#P, i, 1), indx, t); while(1, t=vecmin(vector(#P, i, v[nxt[i]]*P[i]), &indx); if(t>lim, break); if(t>v[#v], listput(v, t)); nxt[indx]++); Vec(v);
%o A279541 ok(p)=p=p%24; p==1 || p==5 || p==7 || p==11;
%o A279541 A192013(n)=sumdivmult(n, d, kronecker(-6, d));
%o A279541 list(lim)=my(u=List([1]),v=[5],r,t); forprime(p=7,, if(ok(p), if(v[#v]*p>lim, break); v=concat(v, v[#v]*p))); v=smooth(v,lim); for(i=2,#v, t=A192013(v[i]); if(t>r, r=t; listput(u,v[i]))); Vec(u)
%Y A279541 Cf. A192013, A279542, A109017.
%K A279541 nonn
%O A279541 1,2
%A A279541 _Charles R Greathouse IV_, Dec 14 2016