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.

A302986 Number of partitions of n into two distinct parts (p,q) such that p, q and |q-p| are all squarefree.

Table of values

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

List of values

[0, 0, 1, 1, 1, 0, 2, 2, 2, 0, 1, 2, 2, 0, 3, 3, 4, 0, 2, 3, 3, 0, 4, 4, 5, 0, 4, 3, 4, 0, 4, 5, 5, 0, 4, 7, 5, 0, 6, 6, 7, 0, 8, 7, 9, 0, 6, 7, 8, 0, 5, 7, 7, 0, 6, 6, 8, 0, 8, 7, 9, 0, 11, 7, 9, 0, 8, 10, 8, 0, 10, 13, 12, 0, 10, 11, 11, 0, 11, 11, 15, 0, 9]