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.

A125182 Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 3
7 1
8 4
9 12
10 7
11 1
12 4
13 38
14 54
15 23
16 1
17 8
18 77
19 248
20 303
21 83
22 1
23 6
24 160
25 824
26 2008
27 1636
28 405
29 1
30 11
31 285
32 2320
33 9449
34 15789
35 10352
36 2113
37 1
38 10
39 476
40 5564
41 37237
42 102726
43 133293
44 70916
45 12657
46 1
47 14
48 799
49 13172
50 122708
51 536900
52 1158368
53 1177168
54 537373
55 82297

List of values

[1, 1, 1, 1, 2, 3, 1, 4, 12, 7, 1, 4, 38, 54, 23, 1, 8, 77, 248, 303, 83, 1, 6, 160, 824, 2008, 1636, 405, 1, 11, 285, 2320, 9449, 15789, 10352, 2113, 1, 10, 476, 5564, 37237, 102726, 133293, 70916, 12657, 1, 14, 799, 13172, 122708, 536900, 1158368, 1177168, 537373, 82297]