Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Aug 20 2024 13:19:56
%S 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,
%T 10,11,11,12,12,13,14,14,15,16,16,16,17,18,18,19,19,19,19,20,21,21,22,
%U 22,22,22,22,22,23,24,25,25,26,26,26,26,26,26,26,26
%N 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).
%H Rémy Sigrist, <a href="/A375502/b375502.txt">Table of n, a(n) for n = 1..1000</a>
%H Rémy Sigrist, <a href="/A375502/a375502.gp.txt">PARI program</a>
%o (PARI) \\ See Links section.
%Y Cf. A373811, A375433, A373813.
%K nonn
%O 1,3
%A _Rémy Sigrist_, Aug 18 2024