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.

A100699 Number of ways to partition n into two squarefree numbers that are not prime.

Table of values

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

List of values

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