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.

A316292 Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8*n)-1)/2)<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 5
5 8
6 16
7 5
8 50
9 65
10 1
11 79
12 314
13 326
14 69
15 872
16 2142
17 1957
18 34
19 1539
20 8799
21 16248
22 13700
23 9
24 1823
25 24818
26 89273
27 137356
28 109601
29 1
30 1494
31 50561
32 355271
33 947713
34 1287350
35 986410
36 856
37 76944
38 1070455
39 4923428
40 10699558
41 13281458
42 9864101

List of values

[1, 1, 2, 1, 5, 8, 16, 5, 50, 65, 1, 79, 314, 326, 69, 872, 2142, 1957, 34, 1539, 8799, 16248, 13700, 9, 1823, 24818, 89273, 137356, 109601, 1, 1494, 50561, 355271, 947713, 1287350, 986410, 856, 76944, 1070455, 4923428, 10699558, 13281458, 9864101]