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.

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

Table of values

n a(n)
1 1
2 4
3 9
4 16
5 25
6 36
7 49
8 51
9 53
10 56
11 57
12 59
13 60
14 60
15 61
16 62
17 64
18 66
19 65
20 64
21 62
22 62
23 64
24 66
25 65
26 67
27 67
28 67
29 66
30 67
31 69
32 67
33 69
34 69
35 70
36 70
37 73
38 73
39 73
40 73
41 73
42 73
43 73
44 73
45 73
46 73
47 73
48 73
49 73
50 73
51 73
52 75
53 76
54 78
55 80
56 80
57 83
58 82
59 83
60 87
61 94
62 99
63 106
64 107
65 108
66 109
67 110
68 111
69 112
70 112

List of values

[1, 4, 9, 16, 25, 36, 49, 51, 53, 56, 57, 59, 60, 60, 61, 62, 64, 66, 65, 64, 62, 62, 64, 66, 65, 67, 67, 67, 66, 67, 69, 67, 69, 69, 70, 70, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 75, 76, 78, 80, 80, 83, 82, 83, 87, 94, 99, 106, 107, 108, 109, 110, 111, 112, 112]