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.

A279536 Count the squarefree numbers appearing in each interval [p,q] where (p,q) is a Goldbach partition of 2n such that all primes from p to q (inclusive) appear as a part in some Goldbach partition of p+q = 2n, and then add the results.

Table of values

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

List of values

[0, 0, 1, 2, 5, 3, 1, 0, 9, 0, 1, 19, 1, 0, 21, 0, 1, 10, 1, 0, 4, 0, 1, 0, 0, 3, 0, 0, 1, 68, 1, 0, 0, 5, 0, 0, 1, 0, 4, 0, 1, 25, 1, 0, 3, 0, 1, 0, 0, 3, 0, 0, 8, 0, 0, 5, 0, 0, 1, 12, 1, 0, 0, 5, 0, 0, 1, 0, 4, 0, 1, 2, 1, 0, 0, 5, 0, 0, 1, 0, 14, 0, 1, 0, 0, 5, 0, 0, 1, 0]