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 A269258 #31 Mar 26 2024 04:51:14
%S A269258 7,37,163,337,2647,5023,9157,9277,15667,22093,24907,40177,43597,47287,
%T A269258 53593,56893,59077,59497,66553,78877,83407,84793,92737,93307,102043,
%U A269258 111577,114577,116953,120607,135193,137383,141397,142543,150067,165463,173713,180007,181903,183943
%N A269258 Primes p such that p+2^4, p+2^6, p+2^8 and p+2^10 are all primes.
%H A269258 Dana Jacobsen, <a href="/A269258/b269258.txt">Table of n, a(n) for n = 1..10727</a>
%H A269258 Debapriyay Mukhopadhyay, <a href="/A269258/a269258.c.txt">C program to generate the terms of the sequences A269257, A269258, A269259, A269859 and A270203 up to 10^8</a>
%F A269258 A269257 INTERSECT A361485. - _R. J. Mathar_, Mar 26 2024
%e A269258 The prime 7 is in the sequence because 7+16 = 23, 7+64 = 71, 7+256 = 263 and 7+1024 = 1031 are all primes.
%e A269258 The prime 37 is in the sequence because 37+16 = 53, 37+64 = 101, 37+256 = 293 and 37+1024 = 1061 are all primes.
%t A269258 Select[Prime@ Range[10^5], Times @@ Boole@ PrimeQ[# + 2^{4, 6, 8, 10}] == 1 &] (* _Michael De Vlieger_, Jul 13 2016 *)
%o A269258 (Perl) use ntheory ":all"; say for sieve_prime_cluster(2,1e5, 16,64,256,1024); # _Dana Jacobsen_, Jul 13 2016
%o A269258 (Magma) [p: p in PrimesInInterval(2,200000) | forall{i: i in [16,64,256,1024] | IsPrime(p+i)}]; // _Vincenzo Librandi_, Jul 16 2016
%Y A269258 Subsequence of A269257.
%K A269258 nonn
%O A269258 1,1
%A A269258 _Debapriyay Mukhopadhyay_, Jul 12 2016