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.

A284825 Number of partitions of n into 3 parts without common divisors such that every pair of them has common divisors.

Table of values

n a(n)
31 1
32 0
33 0
34 0
35 0
36 0
37 1
38 0
39 0
40 0
41 2
42 0
43 1
44 0
45 0
46 0
47 2
48 0
49 1
50 0
51 0
52 0
53 2
54 0
55 1
56 0
57 0
58 0
59 3
60 0
61 5
62 0
63 0
64 0
65 1
66 0
67 5
68 0
69 1
70 0
71 6
72 0
73 6
74 0
75 0
76 0
77 4
78 0
79 6
80 0
81 0
82 0
83 9
84 0
85 2
86 1
87 2
88 0
89 9
90 0
91 8
92 1
93 1
94 0
95 5
96 0
97 14
98 0
99 1
100 0
101 15
102 0
103 14
104 0
105 0
106 1
107 14
108 0
109 14
110 0
111 2
112 0
113 15
114 0
115 6
116 1
117 2
118 1
119 11
120 0
121 18
122 1
123 1
124 0
125 10
126 0
127 23

List of values

[1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 3, 0, 5, 0, 0, 0, 1, 0, 5, 0, 1, 0, 6, 0, 6, 0, 0, 0, 4, 0, 6, 0, 0, 0, 9, 0, 2, 1, 2, 0, 9, 0, 8, 1, 1, 0, 5, 0, 14, 0, 1, 0, 15, 0, 14, 0, 0, 1, 14, 0, 14, 0, 2, 0, 15, 0, 6, 1, 2, 1, 11, 0, 18, 1, 1, 0, 10, 0, 23]