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.

A157272 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) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 1, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 7
5 1
6 1
7 20
8 20
9 1
10 1
11 47
12 155
13 47
14 1
15 1
16 102
17 753
18 753
19 102
20 1
21 1
22 213
23 3004
24 7109
25 3004
26 213
27 1
28 1
29 436
30 10800
31 48727
32 48727
33 10800
34 436
35 1
36 1
37 883
38 36517
39 280736
40 551251
41 280736
42 36517
43 883
44 1
45 1
46 1778
47 118795
48 1454163
49 4879214
50 4879214
51 1454163
52 118795
53 1778
54 1

List of values

[1, 1, 1, 1, 7, 1, 1, 20, 20, 1, 1, 47, 155, 47, 1, 1, 102, 753, 753, 102, 1, 1, 213, 3004, 7109, 3004, 213, 1, 1, 436, 10800, 48727, 48727, 10800, 436, 1, 1, 883, 36517, 280736, 551251, 280736, 36517, 883, 1, 1, 1778, 118795, 1454163, 4879214, 4879214, 1454163, 118795, 1778, 1]