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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 6
5 1
6 1
7 17
8 17
9 1
10 1
11 40
12 126
13 40
14 1
15 1
16 87
17 606
18 606
19 87
20 1
21 1
22 182
23 2413
24 5856
25 2413
26 182
27 1
28 1
29 373
30 8679
31 40337
32 40337
33 8679
34 373
35 1
36 1
37 756
38 29376
39 232726
40 497066
41 232726
42 29376
43 756
44 1
45 1
46 1523
47 95668
48 1205968
49 4527078
50 4527078
51 1205968
52 95668
53 1523
54 1

List of values

[1, 1, 1, 1, 6, 1, 1, 17, 17, 1, 1, 40, 126, 40, 1, 1, 87, 606, 606, 87, 1, 1, 182, 2413, 5856, 2413, 182, 1, 1, 373, 8679, 40337, 40337, 8679, 373, 1, 1, 756, 29376, 232726, 497066, 232726, 29376, 756, 1, 1, 1523, 95668, 1205968, 4527078, 4527078, 1205968, 95668, 1523, 1]