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.

A231555 Number of ways to write n = x + y (x, y > 0) with x*(x + 1) + F(y) prime, where F(y) denotes the y-th Fibonacci number (A000045).

Table of values

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

List of values

[0, 1, 2, 2, 2, 2, 3, 3, 3, 1, 2, 4, 2, 3, 4, 6, 3, 5, 1, 3, 5, 6, 6, 4, 5, 5, 4, 7, 5, 1, 5, 6, 6, 6, 6, 6, 8, 6, 5, 5, 5, 5, 6, 3, 4, 8, 9, 8, 4, 5, 8, 8, 6, 5, 9, 5, 9, 8, 8, 6, 9, 7, 8, 7, 6, 4, 8, 7, 8, 11, 6, 7, 9, 4, 5, 8, 8, 7, 10, 10, 11, 9, 3, 5, 6, 6, 4, 12, 5, 9, 12, 11, 7, 6, 7, 9, 6, 10, 5, 6]