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.

A317191 Fill an n X n square array T(j,k), 1<=j<=n, 1=k<=n, by antidiagonals upwards in which each term is the least nonnegative integer satisfying the condition that no row, column, diagonal, or antidiagonal contains a repeated term; a(n) = T(n,n).

Table of values

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

List of values

[0, 3, 5, 4, 1, 10, 7, 2, 6, 8, 15, 12, 19, 17, 22, 23, 12, 26, 11, 31, 32, 12, 35, 10, 37, 42, 40, 45, 33, 49, 18, 17, 20, 53, 16, 51, 59, 18, 59, 60, 58, 64, 69, 69, 38, 29, 74, 26, 68, 78, 80, 36, 30, 33, 41, 39, 32, 33, 92, 41, 38, 89, 32, 35]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.