A340106 - cp's OEIS frontend

A340106 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	2
6	1
7	3
8	6
9	4
10	1
11	4
12	12
13	20
14	18
15	1
16	5
17	20
18	54
19	100
20	92
21	1
22	6
23	30
24	112
25	318
26	600
27	570
28	1
29	7
30	42
31	200
32	768
33	2208
34	4244
35	4082
36	1
37	8
38	56
39	324
40	1570
41	6080
42	17682
43	34300
44	33292
45	1
46	9
47	72
48	490
49	2868
50	13980
51	54552
52	159702
53	311808
54	304490
55	1
56	10
57	90
58	704
59	4830
60	28392
61	139130
62	545528
63	1604616
64	3147164
65	3086890

[1, 1, 1, 1, 2, 2, 1, 3, 6, 4, 1, 4, 12, 20, 18, 1, 5, 20, 54, 100, 92, 1, 6, 30, 112, 318, 600, 570, 1, 7, 42, 200, 768, 2208, 4244, 4082, 1, 8, 56, 324, 1570, 6080, 17682, 34300, 33292, 1, 9, 72, 490, 2868, 13980, 54552, 159702, 311808, 304490, 1, 10, 90, 704, 4830, 28392, 139130, 545528, 1604616, 3147164, 3086890]

cp's OEIS Frontend

A340106 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3.

Table of values

List of values