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.

A187247 Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at most 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 2
8 3
9 1
10 2
11 4
12 11
13 6
14 1
15 16
16 18
17 40
18 35
19 10
20 1
21 104
22 142
23 178
24 195
25 85
26 15
27 1
28 688
29 1236
30 1106
31 1148
32 665
33 175
34 21
35 1
36 5116
37 10832
38 9300
39 7728
40 5173
41 1820
42 322
43 28
44 1
45 44224
46 98492
47 91680
48 63284
49 42168
50 18165
51 4284
52 546
53 36
54 1
55 438560
56 964172
57 974924
58 627420
59 378620
60 181797
61 53361
62 9030
63 870
64 45
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 2, 4, 11, 6, 1, 16, 18, 40, 35, 10, 1, 104, 142, 178, 195, 85, 15, 1, 688, 1236, 1106, 1148, 665, 175, 21, 1, 5116, 10832, 9300, 7728, 5173, 1820, 322, 28, 1, 44224, 98492, 91680, 63284, 42168, 18165, 4284, 546, 36, 1, 438560, 964172, 974924, 627420, 378620, 181797, 53361, 9030, 870, 45, 1]