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.

A047888 Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 5
9 2
10 1
11 1
12 14
13 6
14 2
15 1
16 1
17 42
18 23
19 6
20 2
21 1
22 1
23 132
24 103
25 24
26 6
27 2
28 1
29 1
30 429
31 513
32 119
33 24
34 6
35 2
36 1
37 1
38 1430
39 2761
40 694
41 120
42 24
43 6
44 2
45 1
46 1
47 4862
48 15767
49 4582
50 719
51 120
52 24
53 6
54 2
55 1
56 1
57 16796
58 94359
59 33324
60 5003
61 720
62 120
63 24
64 6
65 2
66 1
67 1
68 58786
69 586590

List of values

[1, 1, 1, 1, 2, 1, 1, 5, 2, 1, 1, 14, 6, 2, 1, 1, 42, 23, 6, 2, 1, 1, 132, 103, 24, 6, 2, 1, 1, 429, 513, 119, 24, 6, 2, 1, 1, 1430, 2761, 694, 120, 24, 6, 2, 1, 1, 4862, 15767, 4582, 719, 120, 24, 6, 2, 1, 1, 16796, 94359, 33324, 5003, 720, 120, 24, 6, 2, 1, 1, 58786, 586590]