cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Rémy Sigrist, Oct 28 2020

Keywords

Comments

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

Examples

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

Crossrefs

Programs

  • C
    /* See Links section. */