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.

A292671 Upper right triangle A(m,n) = 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 m X m square a symbol occurs more than once.

Table of values

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

List of values

[1, 2, 4, 4, 6, 9, 4, 6, 11, 16, 8, 7, 13, 18, 25, 8, 8, 13, 18, 27, 36, 8, 10, 13, 20, 29, 38, 49, 8, 10, 13, 20, 32, 38, 51, 64, 16, 13, 14, 22, 33, 40, 53, 66, 81, 16, 15, 14, 22, 33, 40, 56, 66, 83, 100, 16, 16, 15, 23, 33, 41, 57, 68, 85, 102]