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.

A066202 Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).

Table of values

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

List of values

[1, 2, 2, 4, 1, 4, 7, 3, 3, 7, 3, 6, 1, 6, 3, 8, 10, 4, 4, 10, 8, 14, 5, 8, 1, 8, 5, 14, 21, 11, 13, 5, 5, 13, 11, 21, 13, 4, 7, 10, 1, 10, 7, 4, 13, 22, 12, 14, 16, 6, 6, 16, 14, 12, 22, 12, 21, 6, 9, 12, 1, 12, 9, 6, 21, 12, 23, 31, 15, 17, 19, 7, 7, 19, 17, 15, 31, 23, 11, 20, 5, 8, 11, 14, 1]