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.

A008304 Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 16
9 6
10 1
11 1
12 69
13 41
14 8
15 1
16 1
17 348
18 293
19 67
20 10
21 1
22 1
23 2016
24 2309
25 602
26 99
27 12
28 1
29 1
30 13357
31 19975
32 5811
33 1024
34 137
35 14
36 1
37 1
38 99376
39 189524
40 60875
41 11304
42 1602
43 181
44 16
45 1
46 1
47 822040
48 1960041
49 690729
50 133669
51 19710
52 2360
53 231
54 18
55 1
56 1
57 7477161

List of values

[1, 1, 1, 1, 4, 1, 1, 16, 6, 1, 1, 69, 41, 8, 1, 1, 348, 293, 67, 10, 1, 1, 2016, 2309, 602, 99, 12, 1, 1, 13357, 19975, 5811, 1024, 137, 14, 1, 1, 99376, 189524, 60875, 11304, 1602, 181, 16, 1, 1, 822040, 1960041, 690729, 133669, 19710, 2360, 231, 18, 1, 1, 7477161]