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 A260678 #21 Sep 08 2022 08:46:13 %S A260678 33,34,37,42,49,50,51,53,56,58,60,65,67,68,69,71,72,75,78,82,83,84,85, %T A260678 86,88,91,94,95,97,100,101,102,105,106,107,110,111,113,114,116,117, %U A260678 118,119,122,123,124,128,129,132,133,134,135,136,139,141,143,148,151,152,153 %N A260678 Numbers n>0 for which n+(17-n)^2 is not prime. %C A260678 Motivated by the fact that n+(17-n)^2 = 1+16^2, 2+15^2, ..., 16+1^2, 17+0^2, 18+1^2, 19+2^2, ..., 32+15^2 are all prime. This has an explanation through Heegener numbers, similar to Euler's prime-generating polynomial, cf. A002837 and related crossrefs. %H A260678 Robert Israel, <a href="/A260678/b260678.txt">Table of n, a(n) for n = 1..10000</a> %p A260678 remove(t -> isprime(t+(17-t)^2), [$1..200]); # _Robert Israel_, May 02 2017 %t A260678 Select[Range[200], !PrimeQ[# + (17 - #)^2] &] (* _Vincenzo Librandi_, Nov 16 2015 *) %o A260678 (PARI) for(n=1,999,isprime(n+(17-n)^2)||print1(n",")) %o A260678 (Magma) [n: n in [1..180] | not IsPrime(n+(17-n)^2)]; // _Vincenzo Librandi_, Nov 16 2015 %Y A260678 Cf. A260679 (n+(17-n)^2), A007635 (primes in that sequence = primes of the form n^2+n+17). %Y A260678 Cf. A002837 (n^2-n+41 is prime), A005846 (primes of form n^2+n+41), A007634 (n^2+n+41 is composite), A097823 (n^2+n+41 is not squarefree). %K A260678 nonn,easy %O A260678 1,1 %A A260678 _M. F. Hasler_, Nov 15 2015