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.

A262494 Triangle read by rows: T(n,k) (n>=1, 0<=k is the number of permutations of n things that require k stack-sorts.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 13
9 8
10 2
11 1
12 41
13 49
14 23
15 6
16 1
17 131
18 276
19 198
20 90
21 24
22 1
23 428
24 1509
25 1556
26 982
27 444
28 120
29 1
30 1429
31 8184
32 11812
33 9678
34 5856
35 2640
36 720
37 1
38 4861
39 44473
40 88566
41 91959
42 68820
43 40800
44 18360
45 5040
46 1
47 16795
48 243334
49 662732
50 863296
51 775134
52 555828
53 325200
54 146160
55 40320

List of values

[1, 1, 1, 1, 4, 1, 1, 13, 8, 2, 1, 41, 49, 23, 6, 1, 131, 276, 198, 90, 24, 1, 428, 1509, 1556, 982, 444, 120, 1, 1429, 8184, 11812, 9678, 5856, 2640, 720, 1, 4861, 44473, 88566, 91959, 68820, 40800, 18360, 5040, 1, 16795, 243334, 662732, 863296, 775134, 555828, 325200, 146160, 40320]