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 A256703 #8 Apr 13 2015 14:44:35 %S A256703 4,292,330,615,625,744,982,1075,1671,2176,2389,2820,2937,3228,3598, %T A256703 4187,6590,7803,9960,10173,11628,13140,13396,14035,15588,16396,17766, %U A256703 18813,19858,21111,21115,21246,22808,23241,24784,25050,25149,25167,25384 %N A256703 Numbers m such that A166133(m+1) = A166133(m)^2 - 1. %H A256703 Ray Chandler, <a href="/A256703/b256703.txt">Table of n, a(n) for n = 1..6575</a> %o A256703 (Haskell) %o A256703 import Data.List (findIndices) %o A256703 a256703 n = a256703_list !! (n-1) %o A256703 a256703_list = map (+ 1) $ findIndices (\(u, v) -> v == u^2-1) $ %o A256703 zip a166133_list (tail a166133_list) %Y A256703 Cf. A166133. %K A256703 nonn %O A256703 1,1 %A A256703 _Reinhard Zumkeller_, Apr 08 2015