login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158075 Prime numbers p such that the largest digit of p - the smallest digit of p is prime. 1
13, 29, 31, 41, 47, 53, 61, 79, 83, 97, 103, 107, 113, 131, 163, 181, 227, 229, 239, 241, 257, 269, 277, 281, 293, 307, 311, 313, 331, 353, 383, 421, 431, 449, 457, 461, 463, 467, 479, 499, 503, 523, 547, 557, 563, 577, 587, 607, 613, 631, 641, 643, 647, 653 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

13 (3-1=2), 29 (9-2=7), 31 (3-1=2), 47 (7-4=3), 53 (5-3=2), etc.

MAPLE

a := proc (n) local nn, nnn: nn := convert(ithprime(n), base, 10): nnn := seq(nn[j], j = 1 .. nops(nn)): if isprime(max(nnn)-min(nnn)) = true then ithprime(n) else end if end proc: seq(a(n), n = 1 .. 150); [From Emeric Deutsch, Apr 01 2009]

MATHEMATICA

ldsdpQ[n_]:=Module[{idn=IntegerDigits[n]}, PrimeQ[Max[idn]-Min[idn]]]; Select[Prime[Range[200]], ldsdpQ] (* Harvey P. Dale, Jun 10 2013 *)

CROSSREFS

Sequence in context: A018955 A240819 A087593 * A087594 A088909 A096451

Adjacent sequences:  A158072 A158073 A158074 * A158076 A158077 A158078

KEYWORD

nonn,base,less

AUTHOR

Juri-Stepan Gerasimov, Mar 12 2009

EXTENSIONS

Missing terms (61,281,449,457,461,463,467,479,727,757,769) added by Emeric Deutsch, Apr 01 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 16:02 EST 2017. Contains 295905 sequences.