A373811 - cp's OEIS frontend

A373811 a(0) = 0. For n > 0, a(n) is the smallest number of straight lines needed to intersect all points (k, a(k)) for 0 <= k < n.

n	a(n)
0	0
1	1
2	1
3	2
4	2
5	2
6	3
7	3
8	3
9	4
10	4
11	4
12	4
13	4
14	5
15	5
16	5
17	5
18	6
19	6
20	6
21	6
22	6
23	6
24	7
25	7
26	7
27	7
28	7
29	8
30	8
31	8
32	8
33	8
34	8
35	8
36	9
37	9
38	9
39	9
40	9
41	9
42	10
43	10
44	10
45	10
46	10
47	10
48	10
49	11
50	11
51	11
52	11
53	11
54	11
55	11
56	11
57	12
58	12
59	12
60	12
61	12
62	12
63	12
64	12
65	13
66	13
67	13
68	13
69	13
70	13
71	13
72	14
73	14
74	14
75	14
76	14
77	14
78	14
79	14
80	15
81	15
82	15
83	15
84	15
85	15
86	15
87	15
88	15
89	16
90	16
91	16
92	16
93	16
94	16
95	16
96	16
97	16
98	17
99	17
100	17
101	17
102	17
103	17
104	17
105	17
106	18

[0, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18]

cp's OEIS Frontend

A373811 a(0) = 0. For n > 0, a(n) is the smallest number of straight lines needed to intersect all points (k, a(k)) for 0 <= k < n.

Table of values

List of values

n	a(n)
0	0
1	1
2	1
3	2
4	2
5	2
6	3
7	3
8	3
9	4
10	4
11	4
12	4
13	4
14	5
15	5
16	5
17	5
18	6
19	6
20	6
21	6
22	6
23	6
24	7
25	7
26	7
27	7
28	7
29	8
30	8
31	8
32	8
33	8
34	8
35	8
36	9
37	9
38	9
39	9
40	9
41	9
42	10
43	10
44	10
45	10
46	10
47	10
48	10
49	11
50	11
51	11
52	11
53	11
54	11
55	11
56	11
57	12
58	12
59	12
60	12
61	12
62	12
63	12
64	12
65	13
66	13
67	13
68	13
69	13
70	13
71	13
72	14
73	14
74	14
75	14
76	14
77	14
78	14
79	14
80	15
81	15
82	15
83	15
84	15
85	15
86	15
87	15
88	15
89	16
90	16
91	16
92	16
93	16
94	16
95	16
96	16
97	16
98	17
99	17
100	17
101	17
102	17
103	17
104	17
105	17
106	18

n	a(n)
0	0
1	1
2	1
3	2
4	2
5	2
6	3
7	3
8	3
9	4
10	4
11	4
12	4
13	4
14	5
15	5
16	5
17	5
18	6
19	6
20	6
21	6
22	6
23	6
24	7
25	7
26	7
27	7
28	7
29	8
30	8
31	8
32	8
33	8
34	8
35	8
36	9
37	9
38	9
39	9
40	9
41	9
42	10
43	10
44	10
45	10
46	10
47	10
48	10
49	11
50	11
51	11
52	11
53	11
54	11
55	11
56	11
57	12
58	12
59	12
60	12
61	12
62	12
63	12
64	12
65	13
66	13
67	13
68	13
69	13
70	13
71	13
72	14
73	14
74	14
75	14
76	14
77	14
78	14
79	14
80	15
81	15
82	15
83	15
84	15
85	15
86	15
87	15
88	15
89	16
90	16
91	16
92	16
93	16
94	16
95	16
96	16
97	16
98	17
99	17
100	17
101	17
102	17
103	17
104	17
105	17
106	18

n	a(n)
0	0
1	1
2	1
3	2
4	2
5	2
6	3
7	3
8	3
9	4
10	4
11	4
12	4
13	4
14	5
15	5
16	5
17	5
18	6
19	6
20	6
21	6
22	6
23	6
24	7
25	7
26	7
27	7
28	7
29	8
30	8
31	8
32	8
33	8
34	8
35	8
36	9
37	9
38	9
39	9
40	9
41	9
42	10
43	10
44	10
45	10
46	10
47	10
48	10
49	11
50	11
51	11
52	11
53	11
54	11
55	11
56	11
57	12
58	12
59	12
60	12
61	12
62	12
63	12
64	12
65	13
66	13
67	13
68	13
69	13
70	13
71	13
72	14
73	14
74	14
75	14
76	14
77	14
78	14
79	14
80	15
81	15
82	15
83	15
84	15
85	15
86	15
87	15
88	15
89	16
90	16
91	16
92	16
93	16
94	16
95	16
96	16
97	16
98	17
99	17
100	17
101	17
102	17
103	17
104	17
105	17
106	18