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.

A370505 T(n,k) is the difference between the number of k-dist-increasing and (k-1)-dist-increasing permutations of [n], where p is k-dist-increasing if k>=0 and p(i) for all i in [n-k]; 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 1
8 2
9 3
10 0
11 1
12 5
13 6
14 12
15 0
16 1
17 9
18 20
19 30
20 60
21 0
22 1
23 19
24 70
25 90
26 180
27 360
28 0
29 1
30 34
31 175
32 420
33 630
34 1260
35 2520
36 0
37 1
38 69
39 490
40 1960
41 2520
42 5040
43 10080
44 20160
45 0
46 1
47 125
48 1554
49 5880
50 15120
51 22680
52 45360
53 90720
54 181440
55 0
56 1
57 251
58 3948
59 21000
60 88200
61 113400
62 226800
63 453600
64 907200
65 1814400

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 3, 0, 1, 5, 6, 12, 0, 1, 9, 20, 30, 60, 0, 1, 19, 70, 90, 180, 360, 0, 1, 34, 175, 420, 630, 1260, 2520, 0, 1, 69, 490, 1960, 2520, 5040, 10080, 20160, 0, 1, 125, 1554, 5880, 15120, 22680, 45360, 90720, 181440, 0, 1, 251, 3948, 21000, 88200, 113400, 226800, 453600, 907200, 1814400]