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.

A201993 Conjectured lower bound for the number of circles of radius 1 that can be packed into a circle of radius n.

Table of values

n a(n)
1 1
2 2
3 6
4 11
5 18
6 26
7 37
8 49
9 63
10 79
11 97
12 116
13 138
14 161
15 186
16 213
17 241
18 272
19 304
20 338
21 374
22 412
23 451
24 492
25 535
26 580
27 627
28 676
29 726
30 778
31 832
32 888
33 946
34 1005
35 1066
36 1130
37 1194
38 1261
39 1330
40 1400
41 1472
42 1546
43 1622
44 1699
45 1779
46 1860
47 1943
48 2028
49 2115
50 2203
51 2293
52 2385

List of values

[1, 2, 6, 11, 18, 26, 37, 49, 63, 79, 97, 116, 138, 161, 186, 213, 241, 272, 304, 338, 374, 412, 451, 492, 535, 580, 627, 676, 726, 778, 832, 888, 946, 1005, 1066, 1130, 1194, 1261, 1330, 1400, 1472, 1546, 1622, 1699, 1779, 1860, 1943, 2028, 2115, 2203, 2293, 2385]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.