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.

A350620 a(n) = smallest k such that A350877(k) = n, or -1 if n does not appear in A350877.

Original entry on oeis.org

1, 7, 2, 6, 71, 3, 25, 5, 22, 70, 30, 13, 345, 24, 27, 16, 161, 21, 148, 69, 32, 29, 51, 43, 1154, 344, 161336, 23, 34, 26, 48, 737, 156, 160, 36, 77534485877, 63, 147, 38, 68, 234, 31, 40, 28, 53, 50, 126, 42, 639, 1153, 58, 343, 73, 161335, 88, 111, 108, 33, 135, 614667, 192, 47, 65, 736, 60, 155, 454, 159, 186, 35, 97, 77534485876, 78, 62, 2340, 146, 143, 37, 24841, 67, 476, 233, 433, 10579, 140, 39, 359, 169, 85, 52, 80, 49, 195, 125, 166, 41, 17282073747557
Offset: 1

Views

Author

N. J. A. Sloane, Jan 23 2022

Keywords

Crossrefs

Cf. A350877. See A350621 for where the primes appear.

Extensions

a(27) was found by Keith F. Lynch, and a(36) and a(72) by Russ Cox.
a(97) and a(115) were found by Martin Ehrenstein using Kim Walisch's primesieve package.
More than the usual number of terms are shown in order to give all the terms up to the extreme value a(97).