This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A154812 Primes p such that the smallest decimal digit of p plus the smallest decimal digit of prime(p) is prime. 0

%I

%S 2,11,13,19,23,29,31,41,47,59,61,67,79,97,103,107,109,113,157,163,167,

%T 191,193,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,

%U 283,293,331,337,367,373,379,383,389,401,419,433,439,443,449,461,463

%N Primes p such that the smallest decimal digit of p plus the smallest decimal digit of prime(p) is prime.

%p for n from 1 to 300 do p := ithprime(n) ; if isprime( A054054(p) +A054054(ithprime(p)) ) then printf("%d,",p ) ; end if; end do: # _R. J. Mathar_, May 05 2010

%t Select[Prime[Range[100]],PrimeQ[Min[IntegerDigits[#]]+Min[ IntegerDigits[ Prime[ #]]]]&] (* _Harvey P. Dale_, Jun 22 2019 *)

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Jan 15 2009

%E Corrected (11, 31, 293, 373 inserted, 457 removed) by _R. J. Mathar_, May 05 2010

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

Last modified July 17 02:56 EDT 2019. Contains 325092 sequences. (Running on oeis4.)