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.

A216248 T(n,k)=((n+k)^2-4*k+3-(-1)^k-(n+k-2)*(-1)^(n+k))/2-1, if k=1 and (n mod 2)=1; T(n,k)=((n+k)^2-4*k+3-(-1)^k-(n+k-2)*(-1)^(n+k))/2, else. Table T(n,k) read by antidiagonals; n, k > 0.

Table of values

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

List of values

[1, 2, 5, 3, 4, 6, 7, 10, 11, 14, 8, 9, 12, 13, 15, 16, 19, 20, 23, 24, 27, 17, 18, 21, 22, 25, 26, 28, 29, 32, 33, 36, 37, 40, 41, 44, 30, 31, 34, 35, 38, 39, 42, 43, 45, 46, 49, 50, 53, 54, 57, 58, 61, 62, 65, 47, 48, 51, 52, 55, 56, 59, 60, 63, 64, 66, 67]