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.

A295281 Number of complete strict tree-factorizations of n > 1.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 4, 1, 0, 1, 1, 1, 3, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 0, 1, 4, 1, 1, 1, 4, 1, 6, 1, 1, 1, 1, 1, 4, 1, 1, 0, 1, 1, 9, 1, 1, 1, 1, 1, 9, 1]