A299070 - cp's OEIS frontend

A299070 Regular triangle T(n,k) is the number of compositions of n whose standard factorization into Lyndon words has k distinct factors.

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

[1, 2, 0, 3, 1, 0, 5, 3, 0, 0, 7, 9, 0, 0, 0, 13, 17, 2, 0, 0, 0, 19, 39, 6, 0, 0, 0, 0, 35, 72, 21, 0, 0, 0, 0, 0, 59, 141, 55, 1, 0, 0, 0, 0, 0, 107, 266, 132, 7, 0, 0, 0, 0, 0, 0, 187, 511, 300, 26, 0, 0, 0, 0, 0, 0, 0]

cp's OEIS Frontend

A299070 Regular triangle T(n,k) is the number of compositions of n whose standard factorization into Lyndon words has k distinct factors.

Table of values

List of values

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

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

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