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.

A152666 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k runs of odd entries (1<=k<=ceiling(n/2)). For example, the permutation 321756498 has 3 runs of odd entries: 3, 175 and 9.

Table of values

n a(n)
1 1
2 2
3 4
4 2
5 12
6 12
7 36
8 72
9 12
10 144
11 432
12 144
13 576
14 2592
15 1728
16 144
17 2880
18 17280
19 17280
20 2880
21 14400
22 115200
23 172800
24 57600
25 2880
26 86400
27 864000
28 1728000
29 864000
30 86400
31 518400
32 6480000
33 17280000
34 12960000
35 2592000
36 86400
37 3628800
38 54432000

List of values

[1, 2, 4, 2, 12, 12, 36, 72, 12, 144, 432, 144, 576, 2592, 1728, 144, 2880, 17280, 17280, 2880, 14400, 115200, 172800, 57600, 2880, 86400, 864000, 1728000, 864000, 86400, 518400, 6480000, 17280000, 12960000, 2592000, 86400, 3628800, 54432000]