A340108 - cp's OEIS frontend

A340108 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive, and rotations are considered to be distinct.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	2
6	1
7	3
8	6
9	0
10	1
11	4
12	12
13	0
14	16
15	1
16	5
17	20
18	30
19	80
20	60
21	1
22	6
23	30
24	84
25	264
26	480
27	456
28	1
29	7
30	42
31	168
32	672
33	1890
34	3612
35	3458
36	1
37	8
38	56
39	288
40	1424
41	5440
42	15744
43	30352
44	29296
45	1
46	9
47	72
48	450
49	2664
50	12870
51	50004
52	145656
53	283104
54	275166
55	1
56	10
57	90
58	660
59	4560
60	26640
61	130080
62	508060
63	1488960
64	2909700
65	2843980

[1, 1, 1, 1, 2, 2, 1, 3, 6, 0, 1, 4, 12, 0, 16, 1, 5, 20, 30, 80, 60, 1, 6, 30, 84, 264, 480, 456, 1, 7, 42, 168, 672, 1890, 3612, 3458, 1, 8, 56, 288, 1424, 5440, 15744, 30352, 29296, 1, 9, 72, 450, 2664, 12870, 50004, 145656, 283104, 275166, 1, 10, 90, 660, 4560, 26640, 130080, 508060, 1488960, 2909700, 2843980]

cp's OEIS Frontend

A340108 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive, and rotations are considered to be distinct.

Table of values

List of values