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.

A306722 Number of pairs of primes (p,q), p < q, which are a solution of the Diophantine equation (p-1)*(q-1) = (2n)^2.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.