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.

Showing 1-4 of 4 results.

A373813 a(n) is the smallest number of straight lines needed to intersect all points (k, prime(k)) for k = 1..n.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15
Offset: 1

Views

Author

Rémy Sigrist and N. J. A. Sloane, Aug 18 2024

Keywords

Comments

Dan Asimov asks if the graph is trying to converge to the Cantor (or Devil's Staircase) function. - N. J. A. Sloane, Aug 25 2024

Crossrefs

Cf. A373814 (run lengths), A373810 (same with y(k) = phi(k)), A373811 (similar with y(k) = a(k)), A375499 (same with y(k)=sigma(k)).
See also A376187, A376188, A376190 for single lines.

Extensions

Terms a(19) onward from Max Alekseyev, Aug 18 2024

A376187 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) for any of these points; a(n) = minimum M(L) over all lines with C(L) = n, or -1 if there is no such line.

Original entry on oeis.org

2, 3, 7, 23, 47, 181, 83, 73, 1069, 521, 701, 1627, 691, 4271, 4261, 3733, 3943, 3929, 10369, 509, 10463, 24683, 10259, 4297, 4159, 34963, 4021, 157907, 24923, 24691, 4027, 162007, 26759, 27283, 164821, 164503, 187721, 164839, 27067, 180437, 27143, 27059, 164663, 27043, 189961
Offset: 1

Views

Author

N. J. A. Sloane, Sep 23 2024

Keywords

Comments

C(L) is the total number of prime points on L, by definition.
This sequence minimizes the largest prime in any line containing n prime-points. For the maximal smallest prime in any line that has the minimal largest prime (i.e. the lines arising in the present sequence), see A376190.
If C(L) = n in the definition is changed to C(L) >= n we get A376188.
Other known values are a(47) = 189887, a(48) = 164707, a(50)-a(58) = [180511, 180463, 26947, 193373, 180289, 180541, 164627, 194083, 186311], a(60) = 193871, a(62)-a(65) = [187471, 194239, 194309, 194141], a(67)-a(70) = [194269, 193723, 193513, 192737], a(76)-a(79) = [194069, 194267, 193789, 193841]. - Max Alekseyev, Sep 27 2024.

Examples

			The following are lines corresponding to a(1) to a(8). We describe the lines by simply listing the primes "prime(k)" corresponding to the points on the line.
  n   L
  1   2
  2   2,3
  3   3,5,7
  4   5,11,17,23
  5   19,23,31,43,47
  6   61,71,101,131,151,181
  7   7,11,59,67,71,79,83
  8   13,17,29,37,41,53,61,73
There are two parallel lines of slope 6 which both contain 20 points. The first contains the points with [x,y] coordinates [45, 197], [51, 233], [52, 239], [54, 251], [55, 257], [56, 263], [57, 269], [64, 311], [71, 353], [72, 359], [76, 383], [77, 389], [79, 401], [86, 443], [87, 449], [89, 461], [92, 479], [94, 491], [96, 503], [97, 509] (here y == -1 mod 6),
and the second contains the points [42, 181], [44, 193], [47, 211], [50, 229], [63, 307], [67, 331], [68,337], [70, 349], [73, 367], [74, 373], [75, 379], [78, 397], [80, 409],[82, 421], [84, 433], [85, 439], [88, 457], [93, 487], [95, 499], [99, 523] (here y == 1 mod 6).
The existence of these two lines was confirmed by _W. Edwin Clark_, who produced the illustration in the LINKS section. This shows an enlargement of the region 35 <= x <= 105. The blue dots are the points on the first line, the red dots those on the second line.
It is interesting to contrast these two 20-point lines with the results in A005115, which gives the earliest arithmetic progressions of primes with a given number of terms. To find an arithmetic progression of 20 primes one has to go out to 572945039351. Of course these primes don't lie on a line, because of the irregular spacing between the primes.
For many further examples of lines containing many prime-points see the Table in the LINKS section.
There are at least five lines of 54 points each and slope 12; and at least 56 lines of 18 points each and slope 12.  There is a 79-point line, connecting (12125,129533)-(17484,193841), again with slope 12. Populous slope-12 lines are common within my search range. - _Don Reble_, Oct 02 2024.
		

Crossrefs

Extensions

a(9) corrected by Rémy Sigrist, Sep 24 2024.
a(12) from W. Edwin Clark, Sep 25 2024.
a(14)-a(45) from Max Alekseyev, Sep 26 2024, and independently confirmed by Don Reble, Oct 02 2024.

A376190 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) for any of these points. a(n) is the maximum of the smallest primes in the lines L with C(L) = n and containing prime A376187(n), or a(n) = -1 if no such lines exist.

Original entry on oeis.org

2, 2, 3, 5, 19, 18, 7, 13, 967, 113, 83, 619, 103, 1583, 1693, 1621, 1759, 1753, 5923, 197, 6143, 15823, 5849, 1609, 1663, 10333, 1613, 152003, 15683, 16111, 1619, 141871, 15649, 15383, 140989, 141811, 136481, 141319, 15667, 136769, 16033, 16619, 141707, 15473, 135649
Offset: 1

Views

Author

N. J. A. Sloane, Sep 25 2024, following a suggestion from W. Edwin Clark

Keywords

Comments

Consider all the lines L in the plane containing exactly n prime-points (k, prime(k)). A376187 minimizes the maximal prime on any such line L, while the present sequence then maximizes the minimal prime on the lines from A376187.
In other words, we first minimize (in A376187) the maximal prime over all lines with exactly n points, and then here we further maximize the minimal prime. The second step minimizes the spread of the points.
For most listed terms, there is only one line L with C(L) = n that contains prime A376187(n). - Max Alekseyev, Sep 28 2024

Examples

			The best line with 5 points contains the primes 19,23,31,43,47, so a(5) = 19 and A376187(5) = 47. See the Table for further examples.
		

Crossrefs

Extensions

Better definition and a(28)-a(45) from Max Alekseyev, Sep 28 2024

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.
Showing 1-4 of 4 results.