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 A256407 #11 Apr 13 2015 15:01:11 %S A256407 3,198,270,522,570,600,822,882,1062,1950,2130,2268,2310,2592,2970, %T A256407 3168,5022,5502,6702,7350,9438,10038,10428,10500,14010,14562,15288, %U A256407 16650,17028,17958,18060,18522,19698,19890,20550,20718,20772,22158,22638,23058,23562,24108,25170,25602 %N A256407 Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n^2-1, in increasing order. %C A256407 Subtracting 1 seems always to give a prime - see A256410. %H A256407 Ray Chandler, <a href="/A256407/b256407.txt">Table of n, a(n) for n = 1..3258</a> %Y A256407 Cf. A166133, A256410. This is A256406 sorted into increasing order. %K A256407 nonn %O A256407 1,1 %A A256407 _N. J. A. Sloane_, Apr 01 2015