cp's OEIS Frontend

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.

A351728 Primes p such that if q is the next prime, p+A004086(q) and q+A004086(p) are prime.

This page as a plain text file.
%I A351728 #45 Mar 23 2022 12:49:29
%S A351728 2,61,83,433,677,2351,2399,2441,4397,4457,4673,6257,6367,6961,8263,
%T A351728 8713,8761,20627,21391,21649,22721,22871,23227,23761,25111,25321,
%U A351728 25589,25609,25741,25841,26597,26731,26981,27179,27271,27299,27367,27409,27481,27961,28559,29881,40609,40927,40933,42197
%N A351728 Primes p such that if q is the next prime, p+A004086(q) and q+A004086(p) are prime.
%C A351728 For each term p except 2, A013632(p) is divisible by 6.
%H A351728 Robert Israel, <a href="/A351728/b351728.txt">Table of n, a(n) for n = 1..10000</a>
%e A351728 a(3) = 83 is a term because it is prime, the next prime is 89, and 83+98 = 181 and 38+89 = 127 are both prime.
%p A351728 revdigs:= proc(n) local L,i; L:= convert(n,base,10);
%p A351728   add(L[-i]*10^(i-1),i=1..nops(L))
%p A351728 end proc:
%p A351728 Primes:= select(isprime, [2,seq(i,i=3..10000,2)]):
%p A351728 RPrimes:= map(revdigs,Primes):
%p A351728 Primes[select(i -> isprime(Primes[i]+RPrimes[i+1]) and isprime(RPrimes[i]+Primes[i+1]), [$1..nops(Primes)-1])]:
%Y A351728 Cf. A004086, A013632.
%K A351728 nonn,base
%O A351728 1,1
%A A351728 _J. M. Bergot_ and _Robert Israel_, Mar 20 2022