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 A292113 #23 Sep 26 2017 02:34:15 %S A292113 2,3,4,8,9,32,36,64,81,100,121,144,228,256,300,400,441,468,800,1200, %T A292113 2964,5202,5408,6084,6400,7500,8100,9216,24556,28092,31329,32176, %U A292113 32400,37296,49017,49152,57600,72156,80400,83161,86352,88200,133200 %N A292113 List of numbers n such that A039654(n) reaches a new record high. %C A292113 Naively, one might have expected these numbers to have some other distinguishing property (primorials, perhaps), but that seems not to be the case. %C A292113 Except for 3 of the listed terms, a(n)-1 or a(n)+1 has at most 2 prime divisors. The same is true for many of the terms themselves, often of the form 2^k, 3^k, 2^k*3^k' or 2^k*5^k'. (Factorization of the terms: 2, 3, 2^2, 2^3, 3^2, 2^5, 2^2*3^2, 2^6, 3^4, 2^2*5^2, 11^2, 2^4*3^2, 2^2*3*19, 2^8, 2^2*3*5^2, 2^4*5^2, 3^2*7^2, 2^2*3^2*13, 2^5*5^2, ...) - _M. F. Hasler_, Sep 25 2017 %H A292113 Hugo Pfoertner, <a href="/A292113/b292113.txt">Table of n, a(n) for n = 1..56</a> %o A292113 (PARI) m=-n=1; until(print1(n","), until(A039654(n++)>m,); m=A039654(n)) \\ _M. F. Hasler_, Sep 25 2017 %Y A292113 Cf. A039654, A039655, A292112. %K A292113 nonn %O A292113 1,1 %A A292113 _N. J. A. Sloane_, Sep 22 2017