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 A028883 #33 Apr 29 2025 22:42:44 %S A028883 2,29,137,317,569,1289,2297,2909,3593,4349,8093,9209,11657,17417, %T A028883 19037,24329,26237,30269,34589,36857,41609,46649,49277,51977,57593, %U A028883 60509,72893,93629,101117,108893,129593,133949,147449,152093,166457,191837,202493,219017,224669 %N A028883 Primes of the form k^2 - 7. %C A028883 Subsequence of primes of A028881. - _Michel Marcus_, Apr 11 2015 %H A028883 Vincenzo Librandi, <a href="/A028883/b028883.txt">Table of n, a(n) for n = 1..3000</a> %H A028883 Patrick De Geest, <a href="http://www.worldofnumbers.com/consemor.htm">Palindromic Quasipronics of the form n(n+x)</a>. %F A028883 a(n) = A028881(A028882(n)). - _Elmo R. Oliveira_, Apr 22 2025 %p A028883 A028883:=n->`if`(isprime(n^2-7), n^2-7, NULL): seq(A028883(n), n=1..500); # _Wesley Ivan Hurt_, Apr 11 2015 %t A028883 Select[Range[3, 410]^2 - 7, PrimeQ] (* _Harvey P. Dale_, Sep 20 2011 *) %o A028883 (Magma) [a: n in [3..500] | IsPrime(a) where a is n^2-7]; // _Vincenzo Librandi_, Dec 01 2011 %o A028883 (PARI) lista(nn) = forprime (n=1, nn, if (issquare(n+7), print1(n, ", "))) \\ _Michel Marcus_, Apr 11 2015 %Y A028883 Cf. A028881, A028882. %K A028883 nonn,easy %O A028883 1,1 %A A028883 _Patrick De Geest_ %E A028883 More terms from _Michel Marcus_, Apr 11 2015