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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068863 a(1) = 2; a(n+1) is the smallest prime not already in the sequence which differs from a(n) at every digit. 3
2, 3, 5, 7, 11, 23, 17, 29, 13, 31, 19, 37, 41, 53, 47, 59, 43, 61, 73, 67, 71, 83, 79, 97, 89, 101, 223, 107, 211, 103, 227, 109, 233, 127, 239, 113, 229, 131, 257, 139, 241, 137, 251, 149, 263, 151, 269, 157, 271, 163, 277, 181, 293, 167, 281, 173, 307, 179 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

13 follows 29 as the smallest prime number not included earlier and differing at every digit position with 29.

CROSSREFS

Cf. A068853.

Cf. A085136.

Sequence in context: A183055 A046689 A048278 * A087521 A078403 A129945

Adjacent sequences:  A068860 A068861 A068862 * A068864 A068865 A068866

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 13 2002

EXTENSIONS

Corrected and extended by Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Feb 02 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:42 EST 2012. Contains 205717 sequences.