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.

A233359 a(n) = |{0 < k < n: L(k) + q(n-k) is prime}|, where L(k) is the k-th Lucas number (A000204), and q(.) is the strict partition function (A000009).

Table of values

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

List of values

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