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.

A292673 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 3 X 3 block no symbol occurs twice.

Table of values

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

List of values

[1, 4, 9, 11, 13, 13, 13, 13, 14, 14, 15, 17, 18, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 34, 35, 38, 39, 40, 42, 45, 47, 49, 51, 53, 54, 55, 55, 55, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 74, 76, 78, 79, 83, 83, 85, 86, 88, 90, 91, 92, 93, 96]