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.

A157118 Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A001263(n*k+1, n-k+1) if k <= n otherwise A001263(n*(n-k)+1, k+1) and T(1, k) = 1, read by rows.

Table of values

n a(n)
0 2
1 1
2 1
3 1
4 6
5 1
6 1
7 27
8 27
9 1
10 1
11 88
12 672
13 88
14 1
15 1
16 225
17 9150
18 9150
19 225
20 1
21 1
22 486
23 98385
24 395352
25 98385
26 486
27 1
28 1
29 931
30 1126951
31 11748681
32 11748681
33 1126951
34 931
35 1
36 1
37 1632
38 14600320
39 402703120
40 588593280
41 402703120
42 14600320
43 1632
44 1
45 1
46 2673
47 201755880
48 16093941435
49 32251030119
50 32251030119
51 16093941435
52 201755880
53 2673
54 1

List of values

[2, 1, 1, 1, 6, 1, 1, 27, 27, 1, 1, 88, 672, 88, 1, 1, 225, 9150, 9150, 225, 1, 1, 486, 98385, 395352, 98385, 486, 1, 1, 931, 1126951, 11748681, 11748681, 1126951, 931, 1, 1, 1632, 14600320, 402703120, 588593280, 402703120, 14600320, 1632, 1, 1, 2673, 201755880, 16093941435, 32251030119, 32251030119, 16093941435, 201755880, 2673, 1]