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.

A103266 Minimal number of squares needed to sum to Fibonacci(n+1).

Table of values

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

List of values

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