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.

A292674 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 4 X 4 block no symbol occurs twice.

Table of values

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

List of values

[1, 4, 9, 16, 18, 18, 20, 20, 22, 22, 23, 23, 23, 24, 25, 26, 26, 26, 29, 32, 32, 34, 36, 38, 38, 38, 42, 42, 42, 44, 44, 45, 48, 49, 49, 49, 54, 54, 54, 56, 59, 59, 64, 65, 68, 69, 70, 73, 76, 78, 79, 79, 82, 82, 83, 86, 87, 89, 90, 92, 95, 95, 96, 96, 97, 97]