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.

A242950 Number of ordered ways to write n = k + m with k > 1 and m > 1 such that the least nonnegative residue of prime(k) modulo k is a square and the least nonnegative residue of prime(m) modulo m is a prime.

Table of values

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

List of values

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