A341285 - cp's OEIS frontend

A341285 Let B be the set of sequences of positive integers {b(k), k >= 0} such that for some k > 0 (necessarily unique) and any m >= 0, b(m+k) = b(m) + b(m+1) + ... + b(m+k-1); let g(b) = b(0); a(n) is the least value of g(b) for an element b of B containing n.

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

[1, 2, 2, 3, 2, 4, 3, 2, 3, 4, 3, 4, 2, 4, 5, 4, 3, 3, 5, 6, 2, 6, 4, 4, 4, 4, 5, 5, 3, 5, 3, 5, 5, 2, 6, 6, 4, 4, 6, 6, 6, 4, 7, 4, 5, 7, 3, 7, 4, 5, 5, 6, 5, 8, 2, 6, 3, 6, 7, 4, 5, 6, 5, 5, 5, 6, 7, 4, 6, 4, 6, 6, 5, 8, 6, 3, 4, 6, 6, 6, 4, 8, 5, 7, 7, 6, 7]

cp's OEIS Frontend

A341285 Let B be the set of sequences of positive integers {b(k), k >= 0} such that for some k > 0 (necessarily unique) and any m >= 0, b(m+k) = b(m) + b(m+1) + ... + b(m+k-1); let g(b) = b(0); a(n) is the least value of g(b) for an element b of B containing n.

Table of values

List of values

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

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

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