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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107931 Numbers n such that n and n-th prime have only one common digit = 0. 4
80, 140, 305, 306, 308, 409, 440, 504, 540, 600, 670, 704, 790, 807, 820, 902, 904, 906, 1011, 1012, 1013, 1014, 1016, 1017, 1072, 1096, 2002, 2025, 2033, 2043, 2052, 2065, 2066, 2067, 2070, 2073, 2097 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Other cases of common digit d: A107932 (d=1), A107933 (d=2), A107934 (d=3), A107935 (d=4), A107936 (d=5), A107937 (d=6), A107938 (d=7), A107939 (d=8), A107940 (d=9). Cf. A107930 - smallest m's for digits 0,...,9.

LINKS

Table of n, a(n) for n=1..37.

EXAMPLE

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

MATHEMATICA

bb={}; Do[If[IntegerDigits [n]\[Intersection]IntegerDigits [Prime[n]]\[Equal]{0}, bb=Append[bb, n]], {n, 3000}]; bb

Select[Range[2200], Intersection[IntegerDigits[#], IntegerDigits[ Prime[#]]] == {0}&] (* Harvey P. Dale, Dec 18 2013 *)

CROSSREFS

Cf. A107930 - A107940.

Sequence in context: A202447 A202440 A248432 * A234134 A134769 A043332

Adjacent sequences:  A107928 A107929 A107930 * A107932 A107933 A107934

KEYWORD

nonn,base

AUTHOR

Zak Seidov, May 28 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 May 30 06:51 EDT 2017. Contains 287302 sequences.