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.

A281118 a(1)=1, a(n>1) = number of tree-factorizations of n.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 1, 4, 2, 2, 1, 6, 1, 2, 2, 12, 1, 6, 1, 6, 2, 2, 1, 20, 2, 2, 4, 6, 1, 8, 1, 32, 2, 2, 2, 28, 1, 2, 2, 20, 1, 8, 1, 6, 6, 2, 1, 76, 2, 6, 2, 6, 1, 20, 2, 20, 2, 2, 1, 38, 1, 2, 6, 112, 2, 8, 1, 6, 2, 8, 1, 116, 1, 2, 6, 6, 2, 8, 1, 76, 12, 2, 1]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.