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.

A376488 a(n) is the least k such that A375422(k) = n.

Original entry on oeis.org

1, 2, 4, 9, 13, 16, 18, 21, 71, 72, 75, 77, 79, 82, 84, 85, 88, 93, 95, 97, 470, 472, 475, 497, 500, 511, 515, 526, 529, 544, 557, 2618, 2738, 2743, 2744, 2749, 2761, 2762, 2827, 2832, 2835, 2862, 2890, 2892, 2895, 2896, 2901, 2902, 2910, 2932, 2938, 2955
Offset: 1

Views

Author

Rémy Sigrist, Sep 25 2024

Keywords

Comments

In other words, a(n) is the least k such that the set {(1, prime(1)), (2, prime(2)), ..., (k, prime(k))} contains n aligned points (where prime(k) denotes the k-th prime number).
Is this sequence infinite?

Crossrefs

Programs

  • PARI
    \\ See Links section.