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.

A202650 Number of ways to write n = p + p(k) + p(m) with 0 < k <= m, where p is a prime and p(.) is the partition function (A000041).

Table of values

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

List of values

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