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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 17
5 1
6 1
7 84
8 84
9 1
10 1
11 355
12 1431
13 355
14 1
15 1
16 1442
17 14827
18 14827
19 1442
20 1
21 1
22 5793
23 127860
24 326591
25 127860
26 5793
27 1
28 1
29 23200
30 1009338
31 5239457
32 5239457
33 1009338
34 23200
35 1
36 1
37 92831
38 7593061
39 71229038
40 145043839
41 71229038
42 7593061
43 92831
44 1

List of values

[1, 1, 1, 1, 17, 1, 1, 84, 84, 1, 1, 355, 1431, 355, 1, 1, 1442, 14827, 14827, 1442, 1, 1, 5793, 127860, 326591, 127860, 5793, 1, 1, 23200, 1009338, 5239457, 5239457, 1009338, 23200, 1, 1, 92831, 7593061, 71229038, 145043839, 71229038, 7593061, 92831, 1]