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.

A359538 Number of partitions of n into at most 3 distinct positive Fibonacci numbers (with a single type of 1).

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 2, 1, 3, 2, 2, 2, 1, 3, 2, 2, 3, 1, 2, 1, 1, 3, 2, 2, 3, 1, 3, 1, 1, 2, 1, 1, 1, 0, 3, 2, 2, 3, 1, 3, 1, 1, 3, 1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 0, 0, 3, 2, 2, 3, 1, 3, 1, 1, 3, 1, 1, 1, 0, 3, 1, 1, 1, 0, 1, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 3, 2, 2, 3, 1, 3]