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.

A301764 Number of ways to choose a constant rooted partition of each part in a constant rooted partition of n such that the flattened sequence is also constant.

Table of values

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

List of values

[1, 1, 2, 3, 4, 4, 6, 5, 6, 7, 8, 5, 10, 7, 8, 10, 10, 6, 12, 7, 12, 13, 10, 5, 14, 12, 11, 11, 14, 7, 18, 9, 12, 13, 11, 12, 20, 10, 10, 13, 18, 9, 20, 9, 14, 20, 12, 5, 20, 15, 19, 14, 17, 7, 18, 16, 20, 17, 12, 5, 26, 13, 12, 21, 18, 17, 24, 9, 15, 13, 22, 9]

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

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