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 A284440 #16 Oct 15 2019 08:41:16
%S A284440 1,21,91,65,451,217,2059,1665,4699,2101,24564,1729,74023,9017,13051,
%T A284440 4097,60691,5833,278693,20801,142003,10649,47611,54145,116251,47321,
%U A284440 19684,21953,338083,54901,501643,53505,141571,219641,169051,80353,386059,515509,453259,16401
%N A284440 Smallest number k such that A049559(k) / A187730(k) = n.
%C A284440 For every n, a(n)-1 is not squarefree.
%H A284440 Amiram Eldar, <a href="/A284440/b284440.txt">Table of n, a(n) for n = 1..450</a>
%t A284440 a[n_]:= Block[{k=1}, While[GCD[k - 1, EulerPhi[k]]/GCD[CarmichaelLambda[k], k - 1] != n, k++]; k]; Table[a[n], {n, 40}] (* _Indranil Ghosh_, Mar 27 2017 *)
%o A284440 (PARI) a(n)={my(k=1); while(gcd(k - 1, eulerphi(k))/gcd(lcm(znstar(k)[2]),k - 1) != n, k++); k}; \\ _Indranil Ghosh_, Mar 27 2017
%Y A284440 Cf. A284089.
%K A284440 nonn
%O A284440 1,2
%A A284440 _Thomas Ordowski_ and _Altug Alkan_, Mar 27 2017