A335391 - cp's OEIS frontend

A335391 Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.

n	a(n)
0	2
1	-1
2	0
3	0
4	1
5	2
6	1
7	0
8	1
9	4
10	2
11	3
12	4
13	7
14	18
15	13
16	16
17	19
18	24
19	35
20	88
21	80
22	95
23	114
24	137
25	168
26	221
27	530
28	579
29	672
30	783
31	916
32	1077
33	1280
34	1589
35	3708
36	4738
37	5397
38	6164
39	7061
40	8114
41	9359
42	10860
43	12979
44	29666
45	43387
46	48704
47	54773
48	61720
49	69697
50	78888
51	89527
52	101976
53	118663
54	266992

[2, -1, 0, 0, 1, 2, 1, 0, 1, 4, 2, 3, 4, 7, 18, 13, 16, 19, 24, 35, 88, 80, 95, 114, 137, 168, 221, 530, 579, 672, 783, 916, 1077, 1280, 1589, 3708, 4738, 5397, 6164, 7061, 8114, 9359, 10860, 12979, 29666, 43387, 48704, 54773, 61720, 69697, 78888, 89527, 101976, 118663, 266992]

cp's OEIS Frontend

A335391 Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.

Table of values

List of values