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.

A256555 Number of ways to write n as the sum of two (unordered) distinct elements of the set {floor(p/3): p is prime}.

Table of values

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

List of values

[1, 1, 2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 5, 7, 6, 6, 7, 7, 8, 7, 8, 9, 7, 10, 7, 7, 9, 9, 9, 9, 12, 11, 10, 12, 8, 10, 10, 10, 9, 9, 13, 11, 10, 13, 11, 11, 12, 10, 10, 14, 14, 12, 12, 15, 13, 13, 13, 12, 14, 14, 15, 14, 13, 19, 13, 13, 15, 11, 13, 13, 15, 16, 17, 19, 16, 16, 15, 17, 15, 15, 17, 17, 16, 20, 16, 16, 20, 17, 19, 17, 18, 20, 17, 21, 18]