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.

A079326 a(n) = the largest number m such that if m monominoes are removed from an n X n square then an L-tromino must remain.

Table of values

n a(n)
2 1
3 2
4 7
5 9
6 17
7 20
8 31
9 35
10 49
11 54
12 71
13 77
14 97
15 104
16 127
17 135
18 161
19 170
20 199
21 209
22 241
23 252
24 287
25 299
26 337
27 350
28 391
29 405
30 449
31 464
32 511
33 527
34 577
35 594
36 647
37 665
38 721
39 740
40 799
41 819
42 881
43 902
44 967
45 989
46 1057
47 1080
48 1151
49 1175
50 1249
51 1274
52 1351
53 1377
54 1457

List of values

[1, 2, 7, 9, 17, 20, 31, 35, 49, 54, 71, 77, 97, 104, 127, 135, 161, 170, 199, 209, 241, 252, 287, 299, 337, 350, 391, 405, 449, 464, 511, 527, 577, 594, 647, 665, 721, 740, 799, 819, 881, 902, 967, 989, 1057, 1080, 1151, 1175, 1249, 1274, 1351, 1377, 1457]