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.

A372357 Array read by upward antidiagonals: A(n, k) = A372356(1+n,k)-2*A372356(n,k), n,k >= 1.

Original entry on oeis.org

0, 0, 2, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 1, 0, 0, 0, 3, -1, -1, 0, 0, 0, 2, -1, 3, 2, 0, 0, 0, 0, 3, 2, 0, -1, 0, 0, 0, 0, 2, 0, 0, -2, 3, 0, 0, 0, 0, 0, 0, 0, 5, 2, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 5, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 3, -1
Offset: 1

Views

Author

Antti Karttunen, Apr 30 2024

Keywords

Examples

			Array begins:
n\k| 1  2  3   4   5   6  7   8  9  10 11  12  13  14  15  16  17 18  19  20  21
---+-----------------------------------------------------------------------------
1  | 0, 2, 0, -1,  1, -1, 2, -1, 3,  3, 0, -2, -2, -1, -1, -1,  2, 5,  1,  1,  1,
2  | 0, 0, 0, -1, -1,  3, 0, -2, 2, -1, 0,  5,  3,  1, -1, -2, -2, 2, -1,  0, -1,
3  | 0, 0, 0,  3, -1,  2, 0,  5, 0, -1, 0,  2, -1, -1,  3,  1,  3, 0, -1, -2, -2,
4  | 0, 0, 0,  2,  3,  0, 0,  2, 0,  3, 0,  0, -1, -2,  2, -1, -1, 0,  3,  4,  1,
5  | 0, 0, 0,  0,  2,  0, 0,  0, 0,  2, 0,  0,  3,  1,  0,  2, -1, 0,  2, -2, -1,
6  | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  2, -1,  0, -1,  3, 0,  0,  3,  2,
7  | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  2,  0, -1,  2, 0,  0, -1, -1,
8  | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -1,  0,  1,  0, 0,  0, -1, -1,
9  | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -1,  0, -2,  0, 0,  0,  3,  1,
10 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  1,  0,  2,  0, 0,  0,  2, -2,
11 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -2,  0, -1,  0, 0,  0,  0,  2,
12 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  2,  0, -2,  0, 0,  0,  0, -1,
13 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -1,  0,  1,  0, 0,  0,  0, -2,
14 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -2,  0, -1,  0, 0,  0,  0,  1,
15 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  1,  0,  3,  0, 0,  0,  0, -1,
16 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -1,  0, -2,  0, 0,  0,  0,  3,
17 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  3,  0,  1,  0, 0,  0,  0, -2,
18 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -2,  0,  0,  0, 0,  0,  0,  1,
19 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  1,  0, -2,  0, 0,  0,  0,  0,
20 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0,  0,  0,  2,  0, 0,  0,  0, -2,
21 | 0, 0, 0,  0,  0,  0, 0,  0, 0,  0, 0,  0,  0, -2,  0, -2,  0, 0,  0,  0,  2,
		

Crossrefs

Programs