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 A122465 #11 Jan 30 2021 01:23:03 %S A122465 5,1683,3678726,22377473783 %N A122465 Smooth Power Quartets: The m-th number in the sequence, n, is part of the minimum quartet of numbers n through n-3 such that the highest prime factor of each number x <= floor(x^(1/m)). %C A122465 These were found by R. Gerbicz. %H A122465 Fred Schneider and R. Gerbicz, <a href="http://www.mersenneforum.org/showthread.php?t=5647">Smooth Power Trios</a>. %e A122465 1680 = 2^4*3*5*7, 1681 = 41^2, 1682 = 2*29^2, 1683 = 3^2*11*17; 7 < floor(sqrt(1680)) = 40 and 41 <= floor(sqrt(1681)) = 41, so 1683 is a term. %Y A122465 Cf. A122463, A122464. %K A122465 hard,more,nonn,uned %O A122465 1,1 %A A122465 _Fred Schneider_, Sep 09 2006