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.

A116479 Maximum number of Fibonacci parts possible in a factorization of n.

Table of values

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

List of values

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