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 A249589 #10 Dec 31 2016 01:26:40
%S A249589 5,17,19,21,23,27,29,31,33,39,49,51,53,69,71,77,79,87,91,97,143,147,
%T A249589 151,157,159,163,171,173,187,191,199,201,229,231,233,239,241,243,247,
%U A249589 251,267,279,283,293,297,301,321,333,351,357,363,369,381,393,423,447,449,453,457,463,467,469,471,477,483,491,493,501,511,517,523
%N A249589 Numbers whose square with initial (= leftmost) digit removed is a prime.
%C A249589 The squares are in A225873.
%H A249589 Harvey P. Dale and Davin Park, <a href="/A249589/b249589.txt">Table of n, a(n) for n = 1..20000</a> [Terms 1 through 1000 were computed by Harvey P. Dale and terms 1001 through 20000 by Davin Park]
%t A249589 Select[Range[600],PrimeQ[FromDigits[Rest[IntegerDigits[#^2]]]]&] (* _Harvey P. Dale_, Dec 13 2015 *)
%t A249589 b /. Flatten[Outer[Solve[a + #2*10^#1 == b^2 && 0 <= a < 10^#1 && Sqrt[#2*10^#1] <= b < Sqrt[10^(#1 + 1)] && a \[Element] Primes, {a, b}, Integers] &, Range[0, 5], Range[9]], 2] (* _Davin Park_, Dec 30 2016 *)
%o A249589 (PARI) is=(n)->isprime(n^2%10^(#Str(n^2)-1))
%Y A249589 Cf. A227916, A225873.
%K A249589 nonn,base
%O A249589 1,1
%A A249589 _M. F. Hasler_, Nov 01 2014
%E A249589 Extended by _Davin Park_, Dec 30 2016