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.

A225356 Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 -22
5 1
6 1
7 -75
8 -75
9 1
10 1
11 -236
12 1446
13 -236
14 1
15 1
16 -721
17 9822
18 9822
19 -721
20 1
21 1
22 -2178
23 58479
24 -201244
25 58479
26 -2178
27 1
28 1
29 -6551
30 325061
31 -2160227
32 -2160227
33 325061
34 -6551
35 1
36 1
37 -19672
38 1736668
39 -19971304
40 49441990
41 -19971304
42 1736668
43 -19672
44 1

List of values

[1, 1, 1, 1, -22, 1, 1, -75, -75, 1, 1, -236, 1446, -236, 1, 1, -721, 9822, 9822, -721, 1, 1, -2178, 58479, -201244, 58479, -2178, 1, 1, -6551, 325061, -2160227, -2160227, 325061, -6551, 1, 1, -19672, 1736668, -19971304, 49441990, -19971304, 1736668, -19672, 1]