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.

A292505 Number of complete orderless tree-factorizations of n >= 2.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 5, 1, 3, 1, 3, 1, 1, 1, 9, 1, 1, 2, 3, 1, 4, 1, 12, 1, 1, 1, 12, 1, 1, 1, 9, 1, 4, 1, 3, 3, 1, 1, 29, 1, 3, 1, 3, 1, 9, 1, 9, 1, 1, 1, 17, 1, 1, 3, 33, 1, 4, 1, 3, 1, 4, 1, 44, 1, 1, 3, 3, 1, 4, 1, 29, 5, 1, 1, 17, 1]