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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 14
5 1
6 1
7 69
8 69
9 1
10 1
11 292
12 1134
13 292
14 1
15 1
16 1187
17 11686
18 11686
19 1187
20 1
21 1
22 4770
23 100737
24 254132
25 100737
26 4770
27 1
28 1
29 19105
30 795723
31 4061249
32 4061249
33 795723
34 19105
35 1
36 1
37 76448
38 5990296
39 55157324
40 111691642
41 55157324
42 5990296
43 76448
44 1

List of values

[1, 1, 1, 1, 14, 1, 1, 69, 69, 1, 1, 292, 1134, 292, 1, 1, 1187, 11686, 11686, 1187, 1, 1, 4770, 100737, 254132, 100737, 4770, 1, 1, 19105, 795723, 4061249, 4061249, 795723, 19105, 1, 1, 76448, 5990296, 55157324, 111691642, 55157324, 5990296, 76448, 1]