|
|
A336382
|
|
Smallest number requiring n steps to reach a prime under the "add a digit" process described in A241181.
|
|
2
|
|
|
2, 1, 6, 4, 24, 22, 20, 4020, 4280, 22198, 22194, 22200, 31400, 360652, 360648, 370260, 604062, 604060, 1357203, 2010734, 4652359, 4652354, 4652352, 17051708, 20831337, 20831329, 20831324, 47326699, 47326692, 123346278, 256526120, 428045488, 436273045
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
As there are arbitrary large prime gaps, the sequence A241181 is unbounded, and the present sequence is infinite.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The number 2 is the least prime number, so a(0) = 2.
The number 6 is the least one requiring 2 "add a digit" steps to reach a prime number, so a(2) = 6.
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|