A218698 - cp's OEIS frontend

A218698 Number T(n,k) of ways to divide the partitions of n into nonempty consecutive subsequences each of which contains only equal parts and parts from distinct subsequences differ by at least k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

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

[1, 1, 1, 3, 2, 2, 6, 3, 2, 2, 14, 5, 4, 3, 3, 27, 7, 4, 3, 2, 2, 60, 11, 8, 6, 5, 4, 4, 117, 15, 8, 6, 4, 3, 2, 2, 246, 22, 13, 9, 8, 6, 5, 4, 4, 490, 30, 15, 12, 8, 7, 5, 4, 3, 3, 1002, 42, 22, 14, 12, 9, 8, 6, 5, 4, 4, 1998, 56, 24, 16, 12, 10, 7, 6, 4, 3, 2, 2]

cp's OEIS Frontend

A218698 Number T(n,k) of ways to divide the partitions of n into nonempty consecutive subsequences each of which contains only equal parts and parts from distinct subsequences differ by at least k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values