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 A260376 #24 Sep 08 2022 08:46:13
%S A260376 2,6,16,20,30,42,78,90,92,102,108,118,124,126,128,132,136,150,160,166,
%T A260376 180,182,186,194,196,202,206,210,214,230,270,280,294,348,356,358,366,
%U A260376 370,374,378,418,436,456,458,472,474,478,492,522,546,556,560,570,584,586,590
%N A260376 Values of n such that prime(prime(n)) + n is a prime number.
%C A260376 Inspired by A061068.
%C A260376 Obviously, sequence only can include even numbers.
%C A260376 Initial primes of the form prime(prime(n)) + n are 7, 47, 257, 373, 647, 1129, 2797, 3389, 3499, 4129, 4447.
%e A260376 For n=2, prime(prime(2)) + 2 = prime(3) + 2 = 7. 7 is a prime number.
%t A260376 Select[Range[600], PrimeQ[Prime[Prime[#]] + #] &] (* _Vincenzo Librandi_, Aug 30 2015 *)
%o A260376 (PARI) for(n=1, 1e3, if(isprime(prime(prime(n))+n), print1(n", ")))
%o A260376 (Magma) [n: n in [1..600] | IsPrime(NthPrime(NthPrime(n))+n)]; // _Vincenzo Librandi_, Aug 30 2015
%o A260376 (Perl) use ntheory ":all"; my @p = grep { is_prime(nth_prime(nth_prime($_))+$_) } 1..10000; say join ", ", @p; # _Dana Jacobsen_, Sep 02 2015
%Y A260376 Cf. A006450.
%K A260376 nonn,easy
%O A260376 1,1
%A A260376 _Altug Alkan_, Aug 29 2015