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 A248697 #33 Oct 29 2023 01:51:57 %S A248697 17,53,107,179,269,503,647,809,1187,1637,1889,2447,2753,3779,4157, %T A248697 4967,5399,5849,6317,6803,7307,7829,8369,10709,11987,12653,13337, %U A248697 14759,15497,16253,17027,19457,26729,29753,31859,32939,35153,38609,42227,44729,47303,52667,55457,61253,65789,68903,70487,72089,73709,75347 %N A248697 Primes of the form k+(k+3)^2 where k is a nonnegative integer. %C A248697 Primes > 3 in A014209. - _Klaus Purath_, Dec 10 2020 %p A248697 A248697:=n->`if`(isprime(n+(n+3)^2), n+(n+3)^2, NULL): seq(A248697(n), n=1..5*10^2); # _Wesley Ivan Hurt_, Oct 11 2014 %t A248697 f[x_] := x + (x + 3)^2; %t A248697 n = 50; result = {}; counter = 0; number = 0; %t A248697 While[counter < n, %t A248697 value = f[number]; %t A248697 If[PrimeQ[value] == True, AppendTo[result, value];counter = counter + 1]; %t A248697 number = number + 1];result %t A248697 Select[Table[n + (n + 3)^2, {n, 0, 300}], PrimeQ] (* _Vincenzo Librandi_, Oct 12 2014 *) %o A248697 (Magma) [a: n in [0..250] | IsPrime(a) where a is n^2+7*n+9]; // _Vincenzo Librandi_, Oct 12 2014 %o A248697 (PARI) for(n=1,10^3,if(isprime(n^2+7*n+9),print1(n^2+7*n+9,", "))) \\ _Derek Orr_, Oct 12 2014 %Y A248697 Cf. A014209. %K A248697 nonn,easy %O A248697 1,1 %A A248697 _Michael Savoric_, Oct 11 2014