cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A276974 Number T(n,k) of permutations of [n] where the minimal distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 4
8 1
9 1
10 0
11 19
12 3
13 1
14 1
15 0
16 103
17 12
18 3
19 1
20 1
21 0
22 651
23 54
24 10
25 3
26 1
27 1
28 0
29 4702
30 281
31 42
32 10
33 3
34 1
35 1
36 0
37 38413
38 1652
39 203
40 37
41 10
42 3
43 1
44 1
45 0
46 350559
47 11017
48 1086
49 166
50 37
51 10
52 3
53 1
54 1
55 0
56 3539511
57 81665
58 6564
59 857
60 151
61 37
62 10
63 3
64 1
65 1
66 0
67 39196758
68 669948
69 44265
70 4900
71 726
72 151
73 37
74 10
75 3
76 1
77 1

List of values

[1, 0, 1, 0, 1, 1, 0, 4, 1, 1, 0, 19, 3, 1, 1, 0, 103, 12, 3, 1, 1, 0, 651, 54, 10, 3, 1, 1, 0, 4702, 281, 42, 10, 3, 1, 1, 0, 38413, 1652, 203, 37, 10, 3, 1, 1, 0, 350559, 11017, 1086, 166, 37, 10, 3, 1, 1, 0, 3539511, 81665, 6564, 857, 151, 37, 10, 3, 1, 1, 0, 39196758, 669948, 44265, 4900, 726, 151, 37, 10, 3, 1, 1]