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.

A205601 Goldbach's problem extended to division: number of decompositions of 2n into the floor of unordered ratios of two primes, floor(q/p) = 2n, where p < 2n < q.

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 4
6 5
7 10
8 5
9 10
10 16
11 12
12 17
13 18
14 16
15 19
16 27
17 23
18 22
19 34
20 27
21 34
22 39
23 39
24 45
25 51
26 41
27 50
28 51
29 44
30 57
31 68
32 71
33 63
34 74
35 63
36 76
37 87
38 84
39 89
40 104
41 94
42 108
43 111
44 99
45 117
46 116
47 120
48 104
49 126
50 114
51 133
52 146
53 149
54 146
55 166
56 148
57 190
58 178
59 182
60 170
61 179
62 173

List of values

[0, 1, 3, 5, 4, 5, 10, 5, 10, 16, 12, 17, 18, 16, 19, 27, 23, 22, 34, 27, 34, 39, 39, 45, 51, 41, 50, 51, 44, 57, 68, 71, 63, 74, 63, 76, 87, 84, 89, 104, 94, 108, 111, 99, 117, 116, 120, 104, 126, 114, 133, 146, 149, 146, 166, 148, 190, 178, 182, 170, 179, 173]