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.

A082017 First row of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.

Table of values

n a(n)
1 1
2 2
3 7
4 6
5 18
6 15
7 28
8 29
9 49
10 45
11 75
12 66
13 94
14 91
15 130
16 120
17 155
18 153
19 201
20 190
21 232
22 231
23 288
24 276
25 325
26 326
27 391
28 378
29 462
30 435
31 508
32 496
33 589
34 561
35 641
36 630
37 732
38 703
39 790
40 780
41 891
42 861
43 955
44 946
45 1066
46 1035
47 1136
48 1128
49 1257
50 1225
51 1333
52 1326
53 1464
54 1431

List of values

[1, 2, 7, 6, 18, 15, 28, 29, 49, 45, 75, 66, 94, 91, 130, 120, 155, 153, 201, 190, 232, 231, 288, 276, 325, 326, 391, 378, 462, 435, 508, 496, 589, 561, 641, 630, 732, 703, 790, 780, 891, 861, 955, 946, 1066, 1035, 1136, 1128, 1257, 1225, 1333, 1326, 1464, 1431]