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.

A238402 Number of ways to write n = p^2 + q - pi(q) with p prime and q among 1, ..., n, where pi(.) is given by A000720.

Table of values

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

List of values

[0, 0, 0, 0, 3, 2, 2, 1, 1, 4, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 4, 3, 3, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 5, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 4, 3, 2, 2, 2, 3, 3, 2, 3, 4, 3, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 2, 4, 2, 2, 3]