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.

A344646 Array read by antidiagonals T(n,k) = ((n+k+1)^2 - (n+k+1) mod 2)/4 + min(n,k) for n and k >= 0.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 2
6 4
7 5
8 5
9 4
10 6
11 7
12 8
13 7
14 6
15 9
16 10
17 11
18 11
19 10
20 9
21 12
22 13
23 14
24 15
25 14
26 13
27 12
28 16
29 17
30 18
31 19
32 19
33 18
34 17
35 16
36 20
37 21
38 22
39 23
40 24
41 23
42 22
43 21
44 20
45 25
46 26
47 27
48 28
49 29
50 29
51 28
52 27
53 26
54 25
55 30
56 31
57 32
58 33
59 34
60 35
61 34
62 33
63 32
64 31
65 30
66 36
67 37
68 38
69 39
70 40
71 41
72 41
73 40
74 39
75 38
76 37
77 36

List of values

[0, 1, 1, 2, 3, 2, 4, 5, 5, 4, 6, 7, 8, 7, 6, 9, 10, 11, 11, 10, 9, 12, 13, 14, 15, 14, 13, 12, 16, 17, 18, 19, 19, 18, 17, 16, 20, 21, 22, 23, 24, 23, 22, 21, 20, 25, 26, 27, 28, 29, 29, 28, 27, 26, 25, 30, 31, 32, 33, 34, 35, 34, 33, 32, 31, 30, 36, 37, 38, 39, 40, 41, 41, 40, 39, 38, 37, 36]