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.

A292672 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 2 X 2 block no symbol occurs twice.

Table of values

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

List of values

[1, 4, 6, 6, 7, 8, 10, 10, 13, 15, 16, 17, 19, 20, 21, 22, 23, 25, 28, 30, 31, 32, 33, 35, 35, 37, 38, 39, 40, 41, 43, 44, 45, 47, 50, 52, 53, 55, 57, 58, 60, 60, 61, 63, 64, 65, 67, 68, 70, 71, 72, 73, 74, 76, 78, 78, 79, 80, 82, 84, 85, 87, 89, 90, 92, 93, 94]