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.

A292678 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 8 X 8 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 66
10 66
11 68
12 68
13 69
14 69
15 70
16 70
17 73
18 76
19 81
20 84
21 83
22 82
23 84
24 79
25 81
26 83
27 85
28 85
29 85
30 85
31 86
32 88
33 88
34 92
35 91
36 88
37 89
38 92
39 89
40 93
41 92
42 92
43 93
44 94
45 95
46 96
47 97
48 98
49 99
50 100
51 101
52 102
53 103
54 104
55 105
56 106
57 107
58 108
59 109
60 110
61 111
62 112
63 113
64 114
65 114
66 114
67 114
68 114
69 114
70 114

List of values

[1, 4, 9, 16, 25, 36, 49, 64, 66, 66, 68, 68, 69, 69, 70, 70, 73, 76, 81, 84, 83, 82, 84, 79, 81, 83, 85, 85, 85, 85, 86, 88, 88, 92, 91, 88, 89, 92, 89, 93, 92, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 114, 114, 114, 114, 114]