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.

A216724 Triangle read by rows: T(n,k) is the number of permutations of [1..n] with k modular progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 3
5 24
6 0
7 100
8 15
9 0
10 5
11 594
12 108
13 18
14 0
15 4389
16 504
17 119
18 21
19 0
20 7
21 35744
22 3520
23 960
24 64
25 32
26 0
27 325395
28 31077
29 5238
30 927
31 207
32 27
33 0
34 9
35 3288600
36 288300
37 42050
38 8800
39 900
40 100
41 50
42 0
43 36489992
44 2946141
45 409827
46 59785
47 9174
48 1518
49 319
50 33
51 0
52 11

List of values

[1, 1, 2, 3, 3, 24, 0, 100, 15, 0, 5, 594, 108, 18, 0, 4389, 504, 119, 21, 0, 7, 35744, 3520, 960, 64, 32, 0, 325395, 31077, 5238, 927, 207, 27, 0, 9, 3288600, 288300, 42050, 8800, 900, 100, 50, 0, 36489992, 2946141, 409827, 59785, 9174, 1518, 319, 33, 0, 11]