A058978 - cp's OEIS frontend

A058978 Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.

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

[1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 2]

cp's OEIS Frontend

A058978 Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.

Table of values

List of values

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

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

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