A375502 a(n) is the minimal number of parallel straight lines needed to intersect all points (k, prime(k)) for k = 1..n (where prime(k) denotes the k-th prime number).
1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 14, 14, 15, 16, 16, 16, 17, 18, 18, 19, 19, 19, 19, 20, 21, 21, 22, 22, 22, 22, 22, 22, 23, 24, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26
Offset: 1
Keywords
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..1000
- Rémy Sigrist, PARI program
Programs
-
PARI
\\ See Links section.