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.

A220508 T(n,k) = n^2 + k if k <= n, otherwise T(n,k) = k*(k + 2) - n; square array T(n,k) read by ascending antidiagonals (n >= 0, k >= 0).

Table of values

n a(n)
0 0
1 1
2 3
3 4
4 2
5 8
6 9
7 5
8 7
9 15
10 16
11 10
12 6
13 14
14 24
15 25
16 17
17 11
18 13
19 23
20 35
21 36
22 26
23 18
24 12
25 22
26 34
27 48
28 49
29 37
30 27
31 19
32 21
33 33
34 47
35 63
36 64
37 50
38 38
39 28
40 20
41 32
42 46
43 62
44 80
45 81
46 65
47 51
48 39
49 29
50 31
51 45
52 61
53 79
54 99
55 100
56 82
57 66
58 52
59 40
60 30
61 44
62 60
63 78
64 98
65 120

List of values

[0, 1, 3, 4, 2, 8, 9, 5, 7, 15, 16, 10, 6, 14, 24, 25, 17, 11, 13, 23, 35, 36, 26, 18, 12, 22, 34, 48, 49, 37, 27, 19, 21, 33, 47, 63, 64, 50, 38, 28, 20, 32, 46, 62, 80, 81, 65, 51, 39, 29, 31, 45, 61, 79, 99, 100, 82, 66, 52, 40, 30, 44, 60, 78, 98, 120]