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.
%I A376488 #6 Sep 28 2024 06:21:37
%S A376488 1,2,4,9,13,16,18,21,71,72,75,77,79,82,84,85,88,93,95,97,470,472,475,
%T A376488 497,500,511,515,526,529,544,557,2618,2738,2743,2744,2749,2761,2762,
%U A376488 2827,2832,2835,2862,2890,2892,2895,2896,2901,2902,2910,2932,2938,2955
%N A376488 a(n) is the least k such that A375422(k) = n.
%C A376488 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).
%C A376488 Is this sequence infinite?
%H A376488 Rémy Sigrist, <a href="/A376488/b376488.txt">Table of n, a(n) for n = 1..102</a>
%H A376488 Rémy Sigrist, <a href="/A376488/a376488.gp.txt">PARI program</a>
%o A376488 (PARI) \\ See Links section.
%Y A376488 Cf. A375422, A376187, A376188.
%K A376488 nonn
%O A376488 1,2
%A A376488 _Rémy Sigrist_, Sep 25 2024