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 A110970 #18 Mar 03 2020 10:26:36 %S A110970 1,9,25,81,225,361,441,1089,1225,2025,2601,3249,3721,5041,7569,7921, %T A110970 12321,13689,15129,18225,21609,30625,31329,38809,42025,47961,53361, %U A110970 59049,65025,77841,88209,91809,94249,99225,110889,123201,126025,131769 %N A110970 Squares of the form 2*prime(n) - prime(n+1). %C A110970 How is the upper limit for the search determined, which ensures that a square difference not previously made does not occur with much larger values? - _Hugo Pfoertner_, Mar 02 2020 %t A110970 Union[Select[(2Prime[ # ] - Prime[ # + 1]) & /@ Range[13000], IntegerQ[Sqrt[ # ]] &]] (* _Ray Chandler_, Oct 07 2005 *) %Y A110970 Cf. A110975, A062234. %Y A110970 Contains n^2 for n in A086381. %K A110970 nonn %O A110970 1,2 %A A110970 _Giovanni Teofilatto_, Sep 27 2005 %E A110970 Corrected and extended by _Ray Chandler_, Oct 07 2005