|
|
A241182
|
|
Smallest number requiring n steps to reach a prime under the "add a digit" process described in A241180.
|
|
12
|
|
|
1, 5, 3, 2, 22, 19, 4020, 4280, 22198, 22194, 22193, 31400, 221101, 360648, 370260, 604062, 604060, 1357201, 2010734, 2010733, 4652353, 4652352, 17051708, 17051707, 20831329, 20831323, 47326699, 47326692, 123346277, 256526120, 428045488, 436273045, 436273038
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
c = 1; nx = n;
While[ !
AnyTrue[nx = Union[Flatten[nx + IntegerDigits[nx]]],
PrimeQ [#] && # > n &], c++];
Return[c]];
Return[i]];
|
|
PROG
|
(C#) See Links section.
|
|
CROSSREFS
|
Related sequences: A241173, A241174, A241175, A241176, A241177, A241178, A241179, A241180, A241181, A241182, A241183, A336382.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|