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.

A245667 Number T(n,k) of sequences in {1,...,n}^n with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 3
5 1
6 0
7 10
8 16
9 1
10 0
11 35
12 175
13 45
14 1
15 0
16 126
17 1771
18 1131
19 96
20 1
21 0
22 462
23 17906
24 23611
25 4501
26 175
27 1
28 0
29 1716
30 184920
31 461154
32 161876
33 13588
34 288
35 1
36 0
37 6435
38 1958979
39 8837823
40 5179791
41 759501
42 34245
43 441
44 1
45 0
46 24310
47 21253375
48 169844455
49 157279903
50 36156355
51 2785525
52 75925
53 640
54 1

List of values

[1, 0, 1, 0, 3, 1, 0, 10, 16, 1, 0, 35, 175, 45, 1, 0, 126, 1771, 1131, 96, 1, 0, 462, 17906, 23611, 4501, 175, 1, 0, 1716, 184920, 461154, 161876, 13588, 288, 1, 0, 6435, 1958979, 8837823, 5179791, 759501, 34245, 441, 1, 0, 24310, 21253375, 169844455, 157279903, 36156355, 2785525, 75925, 640, 1]