Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Jun 08 2014 09:36:40
%S 3,5,11,19,53,67,73,83,109,131,157,167,179,239,281,431,457,499,541,
%T 577,617,683,719,739,839,977,1021,1031,1063,1097,1117,1231,1301,1327,
%U 1439,1451,1459,1493,1559,1571,1913,1949,1999,1997,2099,2137,2221,2287,2447,2459
%N Primes p of the form prime(n) + digitsum(n).
%H K. D. Bajpai, <a href="/A243616/b243616.txt">Table of n, a(n) for n = 1..2534</a>
%e 11 is in the sequence because it is prime and prime(4) + 4 = 7 + 4 = 11.
%e 109 is in the sequence because it is prime and prime(26) + (2+6) = 101 + 8 = 109.
%p with(numtheory): A243616 = proc() local k; k:=ithprime(n)+add(i,i= convert((n),base,10))(n); if isprime(k) then RETURN (k); fi; end: seq(A243616 (), n=1..500);
%t A243616 = {}; Do[t = Prime[n] + Total[IntegerDigits[n]]; If [PrimeQ[t], AppendTo[A243616,t]], {n,500}]; A243616
%Y Cf. A000040, A007953.
%K nonn,base
%O 1,1
%A _K. D. Bajpai_, Jun 07 2014