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.

A319395 Number of partitions of n into exactly two positive Fibonacci numbers.

Table of values

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

List of values

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