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 A133497 #21 Jul 05 2021 09:10:34
%S A133497 4,7,10,14,20,27,35,45,58,73,91,113,138,168,203,244,291,345,408,481,
%T A133497 563,658,766,888,1027,1184,1361,1561,1786,2038,2321,2637,2990,3385,
%U A133497 3824,4312,4855,5457,6124,6863,7679,8581,9576,10672,11879,13207,14666,16267,18024,19949
%N A133497 Numbers k such that A098572(k) - A098572(k-1) = 2.
%e A133497 With b(k) = A098572(k): b(1) = 1, b(2) = 2, b(3) = 3, b(4) = 5, hence b(4)-b(3) = 2 and a(1) = 4.
%p A133497 for n from 1 do
%p A133497 if A098572(n)-A098572(n-1)= 2 then
%p A133497 printf("%d,\n",n) ;
%p A133497 end if;
%p A133497 end do: # _R. J. Mathar_, Mar 13 2015
%o A133497 (PARI) (A=0);for(p=1,1000,B=A;A=B+p^(1/p);if(floor(A)-floor(B)-1;print(p)))
%Y A133497 Cf. A098572.
%K A133497 easy,nonn
%O A133497 1,1
%A A133497 Philippe Lallouet (philip.lallouet(AT)orange.fr), Dec 01 2007
%E A133497 More terms from _Hugo Pfoertner_, Jul 04 2021