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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107930 Least number m such that m and m-th prime have only one common digit = n. 10
80, 11, 52, 23, 14, 54, 56, 7, 138, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

First terms in A107931 - A107940. The sequence is full because there are only 10 decimal digits.

LINKS

Table of n, a(n) for n=0..9.

EXAMPLE

a(0)=80 because 80 and 80th prime 409 have only one common digit = 0 and 80 is the least such a number.

MATHEMATICA

lnm[n_]:=Module[{m=1}, While[Intersection[IntegerDigits[Prime[m]], IntegerDigits[m]] != {n}, m++]; m]; Table[lnm[n], {n, 0, 9}] (* Harvey P. Dale, Jun 19 2015 *)

CROSSREFS

Cf. A107931 - A107940.

Sequence in context: A236236 A031136 A050456 * A239131 A033400 A207144

Adjacent sequences:  A107927 A107928 A107929 * A107931 A107932 A107933

KEYWORD

fini,full,nonn,base

AUTHOR

Zak Seidov, Jun 08 2005

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 3 04:39 EST 2016. Contains 278698 sequences.