login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158328 Lessers p1 of twin primes with prime sums of digits of p1 and p2. 1

%I #16 Apr 09 2018 02:48:19

%S 3,5,41,137,191,197,227,281,311,461,599,641,821,827,881,1031,1091,

%T 1277,1301,1451,1721,1871,2027,2081,2087,2111,2267,2591,2711,2801,

%U 3167,3251,3257,3299,3527,3581,3671,3851,4001,4157,4241,4337,4421,4481,4517,4799

%N Lessers p1 of twin primes with prime sums of digits of p1 and p2.

%C Or, numbers n such that n and n+2 are terms in A046704. [_Zak Seidov_, Feb 02 2010]

%H Robert Israel, <a href="/A158328/b158328.txt">Table of n, a(n) for n = 1..10000</a>

%e a(3)=41 is in the sequence because 41, 41+2=43, 4+1=5 and 4+3=7 are primes.

%e a(4)=137 is in the sequence because 137, 137+2=139, 1+3+7=11 and 1+3+9=13 are primes.

%p sd:= n -> convert(convert(n,base,10),`+`):

%p p:= 1: q:= 2: count:= 0: Res:= NULL:

%p while count < 100 do

%p if q = p+2 and isprime(sd(p)) and isprime(sd(q)) then

%p count:= count+1; Res:= Res, p

%p fi;

%p p:= q; q:= nextprime(q);

%p od:

%p Res; # _Robert Israel_, Apr 08 2018

%t sd[n_]:=Plus@@IntegerDigits[n]; Select[Prime[Range[650]],And@@PrimeQ[{#+2,sd[#],sd[#+2]}] &] (* _Jayanta Basu_, May 25 2013 *)

%Y Cf. A001359, A046704.

%K nonn,base

%O 1,1

%A _Juri-Stepan Gerasimov_, Mar 16 2009

%E Corrected by _Juri-Stepan Gerasimov_, Mar 24 2009

%E 3299 and 4481 inserted by _R. J. Mathar_, Mar 27 2009

%E Example edited by _Robert Israel_, Apr 08 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)