cp's OEIS Frontend

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.

A254123 Least number of terms needed to build n from Fibonacci numbers using + and *.

Table 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 3
13 1
14 2
15 2
16 2
17 3
18 2
19 3
20 3
21 1
22 2
23 2
24 2
25 2
26 2
27 3
28 3
29 2
30 3
31 3
32 3
33 3
34 1
35 2
36 2
37 2
38 3
39 2
40 2
41 3
42 2
43 3
44 3
45 3
46 3
47 2
48 3
49 3
50 3
51 4
52 3
53 3
54 3
55 1
56 2
57 2
58 2
59 3
60 2
61 3
62 3
63 2
64 2
65 2
66 3
67 3
68 2
69 3
70 3
71 3
72 3
73 3
74 3
75 3
76 2
77 3
78 3
79 3
80 3
81 3
82 4
83 4
84 3
85 3
86 3
87 3
88 3
89 1
90 2
91 2
92 2

List of values

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