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.

A233206 Number of ways to write n = k + m (0 < k <= m) with k! + prime(m) prime.

Table of values

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

List of values

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