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.

A157211 Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 1
6 1
7 15
8 15
9 1
10 1
11 50
12 134
13 50
14 1
15 1
16 157
17 960
18 960
19 157
20 1
21 1
22 480
23 6013
24 12636
25 6013
26 480
27 1
28 1
29 1451
30 34717
31 136809
32 136809
33 34717
34 1451
35 1
36 1
37 4366
38 190528
39 1303472
40 2361474
41 1303472
42 190528
43 4366
44 1
45 1
46 13113
47 1012326
48 11392866
49 34496986
50 34496986
51 11392866
52 1012326
53 13113
54 1

List of values

[1, 1, 1, 1, 4, 1, 1, 15, 15, 1, 1, 50, 134, 50, 1, 1, 157, 960, 960, 157, 1, 1, 480, 6013, 12636, 6013, 480, 1, 1, 1451, 34717, 136809, 136809, 34717, 1451, 1, 1, 4366, 190528, 1303472, 2361474, 1303472, 190528, 4366, 1, 1, 13113, 1012326, 11392866, 34496986, 34496986, 11392866, 1012326, 13113, 1]