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.

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

Table of values

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

List of values

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