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.

A298636 Square array T(m,n) = number of ways to draw m-1 horizontal lines [a(i),b(i)] with 0 <= a(i) < b(i) <= n such that if two lines start or end on the same coordinate, no intermediate line crosses this coordinate (see comments); m, n >= 1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 6
9 9
10 1
11 1
12 10
13 36
14 23
15 1
16 1
17 15
18 100
19 181
20 53
21 1
22 1
23 21
24 225
25 845
26 775
27 115
28 1
29 1
30 28
31 441
32 2890
33 5957
34 2956
35 241
36 1
37 1
38 36
39 784
40 8036
41 30862
42 36148
43 10426
44 495
45 1
46 1
47 45
48 1296
49 19278
50 122276
51 278530
52 195934
53 34899
54 1005
55 1
56 1
57 55
58 2025
59 41406
60 398874
61 1560118

List of values

[1, 1, 1, 1, 3, 1, 1, 6, 9, 1, 1, 10, 36, 23, 1, 1, 15, 100, 181, 53, 1, 1, 21, 225, 845, 775, 115, 1, 1, 28, 441, 2890, 5957, 2956, 241, 1, 1, 36, 784, 8036, 30862, 36148, 10426, 495, 1, 1, 45, 1296, 19278, 122276, 278530, 195934, 34899, 1005, 1, 1, 55, 2025, 41406, 398874, 1560118]