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.

A292679 Least number of symbols required to fill a grid of size n X n row by row in the greedy way such that in any row or column or rectangular 9 X 9 block no symbol occurs twice.

Table of values

n a(n)
1 1
2 4
3 9
4 16
5 25
6 36
7 49
8 64
9 81
10 83
11 85
12 88
13 89
14 91
15 92
16 94
17 95
18 95
19 96
20 97
21 100
22 102
23 103
24 104
25 103
26 105
27 102
28 103
29 104
30 104
31 104
32 104
33 105
34 107
35 108
36 108
37 115
38 114
39 115
40 111
41 112
42 112
43 111
44 113
45 117
46 118
47 119
48 120
49 121
50 122
51 123
52 124
53 126
54 126
55 126
56 126
57 126
58 126

List of values

[1, 4, 9, 16, 25, 36, 49, 64, 81, 83, 85, 88, 89, 91, 92, 94, 95, 95, 96, 97, 100, 102, 103, 104, 103, 105, 102, 103, 104, 104, 104, 104, 105, 107, 108, 108, 115, 114, 115, 111, 112, 112, 111, 113, 117, 118, 119, 120, 121, 122, 123, 124, 126, 126, 126, 126, 126, 126]