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.

A107259 Number of ways to represent n as Fibonacci(i) + triangular(j), i,j>=0.

Table of values

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

List of values

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