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.

A157208 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 8
5 1
6 1
7 31
8 31
9 1
10 1
11 102
12 342
13 102
14 1
15 1
16 317
17 2548
18 2548
19 317
20 1
21 1
22 964
23 16001
24 37724
25 16001
26 964
27 1
28 1
29 2907
30 91877
31 423365
32 423365
33 91877
34 2907
35 1
36 1
37 8738
38 501032
39 4070208
40 7922362
41 4070208
42 501032
43 8738
44 1
45 1
46 26233
47 2647858
48 35556134
49 119460466
50 119460466
51 35556134
52 2647858
53 26233
54 1

List of values

[1, 1, 1, 1, 8, 1, 1, 31, 31, 1, 1, 102, 342, 102, 1, 1, 317, 2548, 2548, 317, 1, 1, 964, 16001, 37724, 16001, 964, 1, 1, 2907, 91877, 423365, 423365, 91877, 2907, 1, 1, 8738, 501032, 4070208, 7922362, 4070208, 501032, 8738, 1, 1, 26233, 2647858, 35556134, 119460466, 119460466, 35556134, 2647858, 26233, 1]