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.

A097591 Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of odd length.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 0
7 5
8 0
9 1
10 6
11 0
12 17
13 0
14 1
15 0
16 70
17 0
18 49
19 0
20 1
21 90
22 0
23 500
24 0
25 129
26 0
27 1
28 0
29 1890
30 0
31 2828
32 0
33 321
34 0
35 1
36 2520
37 0
38 23100
39 0
40 13930
41 0
42 769
43 0
44 1
45 0
46 83160
47 0
48 215292
49 0
50 62634
51 0
52 1793
53 0
54 1
55 113400
56 0
57 1549800
58 0
59 1697430
60 0
61 264072
62 0
63 4097
64 0
65 1

List of values

[1, 0, 1, 1, 0, 1, 0, 5, 0, 1, 6, 0, 17, 0, 1, 0, 70, 0, 49, 0, 1, 90, 0, 500, 0, 129, 0, 1, 0, 1890, 0, 2828, 0, 321, 0, 1, 2520, 0, 23100, 0, 13930, 0, 769, 0, 1, 0, 83160, 0, 215292, 0, 62634, 0, 1793, 0, 1, 113400, 0, 1549800, 0, 1697430, 0, 264072, 0, 4097, 0, 1]