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 A375433 #9 Aug 18 2024 09:04:56 %S A375433 0,1,1,2,2,2,3,3,3,4,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,7,7,8,8,8,8,8,8, %T A375433 9,9,9,9,9,10,10,10,10,10,11,11,11,11,11,12,12,12,12,12,12,12,12,12, %U A375433 12,13,13,13,13,13,13,14,14,14,14,14,14,14,15,15,15 %N A375433 a(n) is the smallest number of parallel straight lines needed to intersect all points (k, a(k)) for k < n. %C A375433 This sequence is a variant of A373811. The two sequences coincide over the first 22 terms. %H A375433 Rémy Sigrist, <a href="/A375433/b375433.txt">Table of n, a(n) for n = 1..10000</a> %H A375433 Rémy Sigrist, <a href="/A375433/a375433.png">Illustration for a(21) = 6</a> %H A375433 Rémy Sigrist, <a href="/A375433/a375433.txt">C++ program</a> %F A375433 a(n) <= a(n+1) <= a(n) + 1. %e A375433 See illustration in Links section. %o A375433 (C++) // See Links section. %Y A375433 Cf. A373811, A375465. %K A375433 nonn %O A375433 1,4 %A A375433 _Rémy Sigrist_, Aug 15 2024