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.

A358291 a(n) = smallest k not already in the sequence such that OEIS entry Ak contains n.

Original entry on oeis.org

1, 2, 3, 5, 6, 8, 9, 15, 10, 11, 13, 19, 17, 18, 14, 26, 16, 21, 20, 27, 22, 25, 37, 28, 56, 62, 47, 36, 48, 32, 29, 40, 61, 51, 44, 69, 24, 59, 113, 46, 33, 52, 41, 57, 73, 70, 68, 55, 80, 134, 53, 115, 93, 49, 50, 45, 78, 98, 66, 54, 31, 43, 64, 83, 79, 94, 84
Offset: 0

Views

Author

N. J. A. Sloane, Nov 30 2022

Keywords

Examples

			A000001 contains 0, so a(0) = 1.
A000002 contains 1, so a(1) = 2.
k = 10 is the smallest k not yet in the sequence such that Ak = A000010 contains 8, so a(8) = 10.
		

Crossrefs

Extensions

More terms from Hugo Pfoertner, Dec 01 2022