A343488 - cp's OEIS frontend

A343488 Irregular table T(n, k), n >= 0, k = 1..max(1, n), read by rows; T(n, k) is the number of permutations s of { 1..n } such that p(s) = k where p(s) is the least m > 0 such that, working in Z/nZ, s(i) + m = s(i + m) for i = 1..n.

n	a(n)
0	1
1	1
2	2
3	0
4	3
5	0
6	3
7	4
8	4
9	0
10	16
11	5
12	0
13	0
14	0
15	115
16	6
17	12
18	42
19	0
20	0
21	660
22	7
23	0
24	0
25	0
26	0
27	0
28	5033
29	8
30	24
31	0
32	352
33	0
34	0
35	0
36	39936
37	9
38	0
39	153
40	0
41	0
42	0
43	0
44	0
45	362718
46	10
47	40
48	0
49	0
50	3830
51	0
52	0
53	0
54	0
55	3624920
56	11
57	0
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	39916789
67	12
68	60
69	372
70	1872
71	0
72	45636
73	0
74	0
75	0
76	0
77	0
78	478953648

[1, 1, 2, 0, 3, 0, 3, 4, 4, 0, 16, 5, 0, 0, 0, 115, 6, 12, 42, 0, 0, 660, 7, 0, 0, 0, 0, 0, 5033, 8, 24, 0, 352, 0, 0, 0, 39936, 9, 0, 153, 0, 0, 0, 0, 0, 362718, 10, 40, 0, 0, 3830, 0, 0, 0, 0, 3624920, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39916789, 12, 60, 372, 1872, 0, 45636, 0, 0, 0, 0, 0, 478953648]

cp's OEIS Frontend

A343488 Irregular table T(n, k), n >= 0, k = 1..max(1, n), read by rows; T(n, k) is the number of permutations s of { 1..n } such that p(s) = k where p(s) is the least m > 0 such that, working in Z/nZ, s(i) + m = s(i + m) for i = 1..n.

Table of values

List of values