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 A252089 #19 Jul 18 2023 02:35:19 %S A252089 3,5,11,17,41,47,53,71,83,101,113,131,137,167,173,197,251,257,281,311, %T A252089 347,353,383,431,461,521,587,593,617,647,683,701,743,761,797,827,857, %U A252089 881,911,941,971,983,1013,1061,1091,1097,1103,1187,1223,1277,1301,1373 %N A252089 Primes p such that p + 26 is prime. %H A252089 Seiichi Manyama, <a href="/A252089/b252089.txt">Table of n, a(n) for n = 1..10000</a> %e A252089 17 is in this sequence because 17+26 = 43 is prime. %e A252089 431 is in this sequence because 431+26 = 457 is prime. %t A252089 Select[Prime[Range[200]], PrimeQ[# + 26] &] %o A252089 (Magma) [NthPrime(n): n in [1..250] | IsPrime(NthPrime(n)+26)]; %Y A252089 Cf. sequences of the type p+n are primes: A001359 (n=2), A023200 (n=4), A023201 (n=6), A023202 (n=8), A023203 (n=10), A046133 (n=12), A153417 (n=14), A049488 (n=16), A153418 (n=18), A153419 (n=20), A242476 (n=22), A033560 (n=24), this sequence (n=26), A252090 (n=28), A049481 (n=30), A049489 (n=32), A252091 (n=34), A156104 (n=36); A062284 (n=50), A049490 (n=64), A156105 (n=72), A156107 (n=144). %K A252089 nonn,easy %O A252089 1,1 %A A252089 _Vincenzo Librandi_, Dec 14 2014