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.

A225433 Triangle T(n, k) = T(n, k-1) + (-1)^k*A142458(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 -38
5 1
6 1
7 -165
8 -165
9 1
10 1
11 -676
12 4806
13 -676
14 1
15 1
16 -2723
17 44452
18 44452
19 -2723
20 1
21 1
22 -10914
23 362895
24 -1346780
25 362895
26 -10914
27 1
28 1
29 -43681
30 2780367
31 -20297327
32 -20297327
33 2780367
34 -43681
35 1
36 1
37 -174752
38 20554588
39 -263879264
40 683233990
41 -263879264
42 20554588
43 -174752
44 1

List of values

[1, 1, 1, 1, -38, 1, 1, -165, -165, 1, 1, -676, 4806, -676, 1, 1, -2723, 44452, 44452, -2723, 1, 1, -10914, 362895, -1346780, 362895, -10914, 1, 1, -43681, 2780367, -20297327, -20297327, 2780367, -43681, 1, 1, -174752, 20554588, -263879264, 683233990, -263879264, 20554588, -174752, 1]