A261959 - cp's OEIS frontend

A261959 Number A(n,k) of ordered set partitions of {1,2,...,n} such that no part has the same size as any of its k immediate predecessors; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	3
6	1
7	1
8	1
9	13
10	1
11	1
12	1
13	7
14	75
15	1
16	1
17	1
18	7
19	21
20	541
21	1
22	1
23	1
24	7
25	9
26	81
27	4683
28	1
29	1
30	1
31	7
32	9
33	31
34	793
35	47293
36	1
37	1
38	1
39	7
40	9
41	31
42	403
43	4929
44	545835
45	1
46	1
47	1
48	7
49	9
50	31
51	403
52	1597
53	33029
54	7087261
55	1
56	1
57	1
58	7
59	9
60	31
61	403
62	757
63	7913
64	388537
65	102247563

[1, 1, 1, 1, 1, 3, 1, 1, 1, 13, 1, 1, 1, 7, 75, 1, 1, 1, 7, 21, 541, 1, 1, 1, 7, 9, 81, 4683, 1, 1, 1, 7, 9, 31, 793, 47293, 1, 1, 1, 7, 9, 31, 403, 4929, 545835, 1, 1, 1, 7, 9, 31, 403, 1597, 33029, 7087261, 1, 1, 1, 7, 9, 31, 403, 757, 7913, 388537, 102247563]

cp's OEIS Frontend

A261959 Number A(n,k) of ordered set partitions of {1,2,...,n} such that no part has the same size as any of its k immediate predecessors; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values