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.

A376188 For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.

This page as a plain text file.
%I A376188 #26 Apr 07 2025 09:12:02
%S A376188 2,3,7,23,47,73,73,73,509,509,509,509,509,509,509,509,509,509,509,509,
%T A376188 4021,4021,4021,4021,4021,4021,4021,4027,4027,4027,4027,26759,26759,
%U A376188 26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947,26947
%N A376188 For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.
%C A376188 To avoid any confusion, C(L) is the total number of prime points on L, by definition.
%C A376188 See A376187 (which considers lines L with C(L) equal to n) for further information.
%H A376188 Max Alekseyev, <a href="/A376188/b376188.txt">Table of n, a(n) for n = 1..79</a>
%Y A376188 Cf. A005115, A373813, A376187, A376190.
%K A376188 nonn
%O A376188 1,1
%A A376188 _N. J. A. Sloane_, Sep 23 2024
%E A376188 a(21)-a(52) from _Max Alekseyev_, Sep 28 2024