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.

A292675 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 5 X 5 block no symbol occurs twice.

Table of values

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

List of values

[1, 4, 9, 16, 25, 27, 29, 32, 33, 33, 33, 34, 35, 35, 35, 36, 37, 38, 40, 40, 40, 40, 40, 40, 40, 40, 41, 43, 42, 42, 46, 47, 48, 52, 53, 53, 54, 57, 58, 58, 59, 62, 63, 64, 66, 68, 70, 72, 73, 74, 75, 75, 78, 78, 79, 80, 82, 83, 85, 86, 88, 91, 92, 97, 96, 98]