login
A375433
a(n) is the smallest number of parallel straight lines needed to intersect all points (k, a(k)) for k < n.
3
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, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15
OFFSET
1,4
COMMENTS
This sequence is a variant of A373811. The two sequences coincide over the first 22 terms.
LINKS
Rémy Sigrist, C++ program
FORMULA
a(n) <= a(n+1) <= a(n) + 1.
EXAMPLE
See illustration in Links section.
PROG
(C++) // See Links section.
CROSSREFS
Sequence in context: A172471 A373811 A373810 * A046155 A026819 A302342
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Aug 15 2024
STATUS
approved