login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A124116
a(n) the smallest positive integer such that a(n)+10^k is prime for k=1,2...n.
0
1, 1, 9, 9, 559, 847, 15127, 54621, 54621, 5893321, 167459299, 3595903759, 3595903759, 1040749968601, 688840705177051, 430442854738298199
OFFSET
1,3
COMMENTS
Infinite under Dickson's conjecture. - Charles R Greathouse IV, Jan 26 2012
LINKS
Carlos Rivera, Puzzle 554. P+10^n, The Prime Puzzles and Problems Connection.
FORMULA
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: A171738 A309316 A366930 * A213154 A226050 A058200
KEYWORD
hard,nonn
AUTHOR
Anton Vrba (antonvrba(AT)yahoo.com), Nov 28 2006
EXTENSIONS
a(12)-a(13) from Michael S. Branicky, Sep 19 2022
a(14)-a(16) from Jens Kruse Andersen, Sep 23 2022
STATUS
approved