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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 1
6 1
7 8
8 8
9 1
10 1
11 19
12 42
13 19
14 1
15 1
16 42
17 186
18 186
19 42
20 1
21 1
22 89
23 730
24 1362
25 730
26 89
27 1
28 1
29 184
30 2640
31 8540
32 8540
33 2640
34 184
35 1
36 1
37 375
38 9030
39 47810
40 79952
41 47810
42 9030
43 375
44 1
45 1
46 758
47 29722
48 246530
49 652460
50 652460
51 246530
52 29722
53 758
54 1

List of values

[1, 1, 1, 1, 3, 1, 1, 8, 8, 1, 1, 19, 42, 19, 1, 1, 42, 186, 186, 42, 1, 1, 89, 730, 1362, 730, 89, 1, 1, 184, 2640, 8540, 8540, 2640, 184, 1, 1, 375, 9030, 47810, 79952, 47810, 9030, 375, 1, 1, 758, 29722, 246530, 652460, 652460, 246530, 29722, 758, 1]