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.

A376215 Maximum number of non-overlapping discs with a diameter of 1 that can fit within an n×n square, using hexagonal packing or square packing, whichever is more efficient.

Table of values

n a(n)
1 1
2 4
3 9
4 16
5 25
6 36
7 49
8 68
9 85
10 105
11 126
12 150
13 175
14 216
15 247
16 279
17 314
18 350
19 389
20 429
21 492
22 538
23 585
24 635
25 686
26 740
27 822
28 880
29 941
30 1003
31 1068
32 1134
33 1203
34 1307
35 1380
36 1456
37 1533
38 1613
39 1694
40 1817
41 1904
42 1992
43 2083
44 2175
45 2270
46 2366
47 2511
48 2613
49 2716
50 2822
51 2929
52 3039

List of values

[1, 4, 9, 16, 25, 36, 49, 68, 85, 105, 126, 150, 175, 216, 247, 279, 314, 350, 389, 429, 492, 538, 585, 635, 686, 740, 822, 880, 941, 1003, 1068, 1134, 1203, 1307, 1380, 1456, 1533, 1613, 1694, 1817, 1904, 1992, 2083, 2175, 2270, 2366, 2511, 2613, 2716, 2822, 2929, 3039]