Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124116
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124116 a(n) the smallest positive integer such that a(n)+10^k is prime for k=1,2...n. +0
1
1, 1, 9, 9, 559, 847, 15127, 54621, 54621, 5893321, 167459299 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) == 0(mod 7) for n>5

EXAMPLE

a(5)=559 because 569, 659, 1559, 10559 and 100559 are all prime

CROSSREFS

Sequence in context: A121389 A065242 A050720 this_sequence A058200 A067450 A109409

Adjacent sequences: A124113 A124114 A124115 this_sequence A124117 A124118 A124119

KEYWORD

hard,nonn

AUTHOR

Anton Vrba (antonvrba(AT)yahoo.com), Nov 28 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research