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 A253605 #15 Dec 24 2024 08:10:57
%S A253605 17,41,27649987598537,30431463129071,58326356511581,161966446726157,
%T A253605 291598227841757
%N A253605 Primes p such that the polynomial x^2 + x + p generates only primes for x=1..13.
%o A253605 (PARI) isok(p) = {for (n=1, 13, if (! isprime(subst(x^2+x+p, x, n)), return (0));); 1;} \\ _Michel Marcus_, Jan 13 2015
%o A253605 (Perl) use ntheory qw(:all); local $| = 1; my $lo = 2; my $hi = 2*$lo; while (1) { print "$_, " for sieve_prime_cluster($lo, $hi, map { $_*($_+1) } 1..13); $lo = $hi+1; $hi = 2*$lo } # _Daniel Suteu_, Dec 22 2024
%Y A253605 Subsequence of A253592 and A191458. Cf. A164926.
%K A253605 nonn,more
%O A253605 1,1
%A A253605 _Zak Seidov_, Jan 05 2015
%E A253605 a(5)-a(7) from _Daniel Suteu_, Dec 22 2024