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.

A157209 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 = 3, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 11
5 1
6 1
7 54
8 54
9 1
10 1
11 229
12 822
13 229
14 1
15 1
16 932
17 8368
18 8368
19 932
20 1
21 1
22 3747
23 72066
24 174758
25 72066
26 3747
27 1
28 1
29 15010
30 570006
31 2759750
32 2759750
33 570006
34 15010
35 1
36 1
37 60065
38 4297714
39 37366190
40 73850596
41 37366190
42 4297714
43 60065
44 1
45 1
46 240288
47 31495488
48 460448520
49 1591033788
50 1591033788
51 460448520
52 31495488
53 240288
54 1

List of values

[1, 1, 1, 1, 11, 1, 1, 54, 54, 1, 1, 229, 822, 229, 1, 1, 932, 8368, 8368, 932, 1, 1, 3747, 72066, 174758, 72066, 3747, 1, 1, 15010, 570006, 2759750, 2759750, 570006, 15010, 1, 1, 60065, 4297714, 37366190, 73850596, 37366190, 4297714, 60065, 1, 1, 240288, 31495488, 460448520, 1591033788, 1591033788, 460448520, 31495488, 240288, 1]