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.

A157207 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 = 1, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 5
5 1
6 1
7 14
8 14
9 1
10 1
11 33
12 94
13 33
14 1
15 1
16 72
17 442
18 442
19 72
20 1
21 1
22 151
23 1752
24 3818
25 1752
26 151
27 1
28 1
29 310
30 6306
31 25358
32 25358
33 6306
34 310
35 1
36 1
37 629
38 21390
39 144524
40 268852
41 144524
42 21390
43 629
44 1
45 1
46 1268
47 69822
48 746744
49 2312836
50 2312836
51 746744
52 69822
53 1268
54 1

List of values

[1, 1, 1, 1, 5, 1, 1, 14, 14, 1, 1, 33, 94, 33, 1, 1, 72, 442, 442, 72, 1, 1, 151, 1752, 3818, 1752, 151, 1, 1, 310, 6306, 25358, 25358, 6306, 310, 1, 1, 629, 21390, 144524, 268852, 144524, 21390, 629, 1, 1, 1268, 69822, 746744, 2312836, 2312836, 746744, 69822, 1268, 1]