A336382 Smallest number requiring n steps to reach a prime under the "add a digit" process described in A241181.

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

Offset

0,1

Comments

This sequence is to A241181 what A241182 is to A241180.

As there are arbitrary large prime gaps, the sequence A241181 is unbounded, and the present sequence is infinite.

Links

Table of n, a(n) for n=0..32.

Rémy Sigrist, PARI program for A336382

Formula

A241181(a(n)) = n.

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

Cf. A241180, A241181, A241182.

Sequence in context: A185586 A128728 A084950 * A358282 A180317 A066654

Adjacent sequences: A336379 A336380 A336381 * A336383 A336384 A336385

Keyword

nonn,base

Author

Rémy Sigrist, Jul 25 2020

Status

approved