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.

A291722 Number T(n,k) of permutations p of [n] such that in 0p the sum of all jumps equals k + n; triangle T(n,k), n >= 0, 0 <= k <= n*(n-1)/2, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 1
9 6
10 6
11 5
12 4
13 1
14 1
15 1
16 10
17 20
18 20
19 26
20 15
21 15
22 6
23 5
24 1
25 1
26 1
27 15
28 50
29 70
30 105
31 106
32 104
33 90
34 65
35 51
36 27
37 21
38 7
39 6
40 1
41 1
42 1
43 21
44 105
45 210
46 350
47 497
48 554
49 644
50 567
51 574
52 420
53 386
54 238
55 203
56 105
57 85
58 35
59 28
60 8
61 7
62 1
63 1

List of values

[1, 1, 1, 1, 1, 3, 1, 1, 1, 6, 6, 5, 4, 1, 1, 1, 10, 20, 20, 26, 15, 15, 6, 5, 1, 1, 1, 15, 50, 70, 105, 106, 104, 90, 65, 51, 27, 21, 7, 6, 1, 1, 1, 21, 105, 210, 350, 497, 554, 644, 567, 574, 420, 386, 238, 203, 105, 85, 35, 28, 8, 7, 1, 1]