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.

A324362 Total number of occurrences of k in the (signed) displacement sets of all permutations of [n+k] divided by k!; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 3
9 4
10 0
11 1
12 5
13 13
14 15
15 0
16 1
17 7
18 28
19 67
20 76
21 0
22 1
23 9
24 49
25 179
26 411
27 455
28 0
29 1
30 11
31 76
32 375
33 1306
34 2921
35 3186
36 0
37 1
38 13
39 109
40 679
41 3181
42 10757
43 23633
44 25487
45 0
46 1
47 15
48 148
49 1115
50 6576
51 29843
52 98932
53 214551
54 229384
55 0
56 1
57 17
58 193
59 1707
60 12151
61 69299
62 307833
63 1006007
64 2160343
65 2293839

List of values

[0, 0, 1, 0, 1, 1, 0, 1, 3, 4, 0, 1, 5, 13, 15, 0, 1, 7, 28, 67, 76, 0, 1, 9, 49, 179, 411, 455, 0, 1, 11, 76, 375, 1306, 2921, 3186, 0, 1, 13, 109, 679, 3181, 10757, 23633, 25487, 0, 1, 15, 148, 1115, 6576, 29843, 98932, 214551, 229384, 0, 1, 17, 193, 1707, 12151, 69299, 307833, 1006007, 2160343, 2293839]