A338451 a(n) is the least positive number that does not appear among the first n terms of A338338.

2, 3, 3, 3, 5, 5, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 17, 17, 17, 17, 17, 19, 19, 19, 19, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 29

Offset

1,1

Comments

Conjecture: this sequence is unbounded (and A338338 is a permutation of the positive numbers).

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, C program for A338451

Example

For n = 3:
- A338338(1) = 1,
- A338338(2) = 2,
- A338338(3) = 4,
- the number 3 is the least missing number,
- so a(3) = 3.

Prog

(C) /* See Links section. */

Crossrefs

Cf. A280740, A338338.

Sequence in context: A014202 A309247 A238211 * A145281 A151687 A160573

Adjacent sequences: A338448 A338449 A338450 * A338452 A338453 A338454

Keyword

nonn

Author

Rémy Sigrist, Oct 28 2020

Status

approved