A091613 - cp's OEIS frontend

A091613 Triangle: T(n,k) = number of compositions (ordered partitions) of n such that some part is repeated consecutively k times and no part is repeated consecutively more than k times.

n	a(n)
1	1
2	1
3	1
4	3
5	0
6	1
7	4
8	3
9	0
10	1
11	7
12	6
13	2
14	0
15	1
16	14
17	10
18	5
19	2
20	0
21	1
22	23
23	23
24	11
25	4
26	2
27	0
28	1
29	39
30	50
31	22
32	10
33	4
34	2
35	0
36	1
37	71
38	99
39	48
40	22
41	9
42	4
43	2
44	0
45	1
46	124
47	200
48	105
49	46
50	21
51	9
52	4
53	2
54	0
55	1
56	214
57	404
58	223
59	101
60	46
61	20
62	9
63	4
64	2
65	0
66	1
67	378
68	805
69	468
70	218
71	98
72	45
73	20
74	9
75	4
76	2
77	0
78	1
79	661
80	1599
81	979
82	466
83	213
84	98
85	44
86	20
87	9
88	4
89	2
90	0
91	1

[1, 1, 1, 3, 0, 1, 4, 3, 0, 1, 7, 6, 2, 0, 1, 14, 10, 5, 2, 0, 1, 23, 23, 11, 4, 2, 0, 1, 39, 50, 22, 10, 4, 2, 0, 1, 71, 99, 48, 22, 9, 4, 2, 0, 1, 124, 200, 105, 46, 21, 9, 4, 2, 0, 1, 214, 404, 223, 101, 46, 20, 9, 4, 2, 0, 1, 378, 805, 468, 218, 98, 45, 20, 9, 4, 2, 0, 1, 661, 1599, 979, 466, 213, 98, 44, 20, 9, 4, 2, 0, 1]

cp's OEIS Frontend

A091613 Triangle: T(n,k) = number of compositions (ordered partitions) of n such that some part is repeated consecutively k times and no part is repeated consecutively more than k times.

Table of values

List of values