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.

A154263 Number of triples such that p+F_s+(F_t)^3=n, where p is an odd prime, s and t are greater than one and F_s or F_t is odd.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 1
9 3
10 1
11 2
12 2
13 2
14 4
15 2
16 5
17 3
18 2
19 3
20 4
21 3
22 4
23 2
24 3
25 4
26 5
27 3
28 4
29 2
30 2
31 3
32 7
33 6
34 5
35 6
36 3
37 4
38 5
39 4
40 9
41 4
42 6
43 6
44 3
45 7
46 7
47 5
48 5
49 4
50 5

List of values

[0, 0, 0, 0, 1, 1, 2, 1, 3, 1, 2, 2, 2, 4, 2, 5, 3, 2, 3, 4, 3, 4, 2, 3, 4, 5, 3, 4, 2, 2, 3, 7, 6, 5, 6, 3, 4, 5, 4, 9, 4, 6, 6, 3, 7, 7, 5, 5, 4, 5]