A322013 - cp's OEIS frontend

A322013 Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.

n	a(n)
1	1
2	1
3	0
4	1
5	1
6	0
7	1
8	5
9	1
10	0
11	1
12	36
13	29
14	1
15	0
16	1
17	329
18	1721
19	182
20	1
21	0
22	1
23	3655
24	163386
25	94376
26	1198
27	1
28	0
29	1
30	47844
31	22831355
32	98371884
33	5609649
34	8142
35	1
36	0
37	1
38	721315
39	4420321081
40	182502973885
41	66218360625
42	351574834
43	56620
44	1
45	0

[1, 1, 0, 1, 1, 0, 1, 5, 1, 0, 1, 36, 29, 1, 0, 1, 329, 1721, 182, 1, 0, 1, 3655, 163386, 94376, 1198, 1, 0, 1, 47844, 22831355, 98371884, 5609649, 8142, 1, 0, 1, 721315, 4420321081, 182502973885, 66218360625, 351574834, 56620, 1, 0]

cp's OEIS Frontend

A322013 Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.

Table of values

List of values