A380401 - cp's OEIS frontend

A380401 Triangle read by rows: T(n,k) is the number of necklace permutations of a multiset whose multiplicities are given by the k-th partition of n in graded reflected lexicographic order.

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	6
8	3
9	2
10	1
11	1
12	24
13	12
14	6
15	4
16	2
17	1
18	1
19	120
20	60
21	30
22	16
23	20
24	10
25	4
26	5
27	3
28	1
29	1
30	720
31	360
32	180
33	90
34	120
35	60
36	30
37	20
38	30
39	15
40	5
41	6
42	3
43	1
44	1
45	5040
46	2520
47	1260
48	630
49	318
50	840
51	420
52	210
53	140
54	70
55	210
56	105
57	54
58	35
59	10
60	42
61	21
62	7
63	7
64	4
65	1
66	1
67	40320
68	20160
69	10080
70	5040
71	2520
72	6720
73	3360
74	1680
75	840
76	1120
77	560
78	188
79	1680
80	840
81	420
82	280
83	140
84	70
85	336
86	168
87	84
88	56
89	14
90	56
91	28
92	10
93	8
94	4
95	1
96	1

[1, 1, 1, 2, 1, 1, 6, 3, 2, 1, 1, 24, 12, 6, 4, 2, 1, 1, 120, 60, 30, 16, 20, 10, 4, 5, 3, 1, 1, 720, 360, 180, 90, 120, 60, 30, 20, 30, 15, 5, 6, 3, 1, 1, 5040, 2520, 1260, 630, 318, 840, 420, 210, 140, 70, 210, 105, 54, 35, 10, 42, 21, 7, 7, 4, 1, 1, 40320, 20160, 10080, 5040, 2520, 6720, 3360, 1680, 840, 1120, 560, 188, 1680, 840, 420, 280, 140, 70, 336, 168, 84, 56, 14, 56, 28, 10, 8, 4, 1, 1]

cp's OEIS Frontend

A380401 Triangle read by rows: T(n,k) is the number of necklace permutations of a multiset whose multiplicities are given by the k-th partition of n in graded reflected lexicographic order.

Table of values

List of values