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.

A066201 Array read by antidiagonals upwards: for n-th row (n>=0), T(n,0) = 1; for k > 0, T(n,k) = T(n,k-1)-(n+k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(n+k-1).

Table of values

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

List of values

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