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.

A292676 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 6 X 6 block no symbol occurs twice.

Table of values

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

List of values

[1, 4, 9, 16, 25, 36, 38, 38, 40, 40, 41, 41, 43, 45, 48, 48, 50, 49, 49, 49, 49, 50, 50, 51, 51, 52, 51, 52, 53, 53, 53, 53, 53, 53, 55, 53, 55, 55, 59, 59, 59, 61, 65, 64, 66, 70, 68, 69, 72, 73, 78, 78, 79, 84, 85, 85, 86, 90, 90, 90, 94, 93, 96, 97, 99, 102, 105, 106, 106, 107]