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.

A374338 Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of vertices constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections. See the Comments.

Table of values

n a(n)
1 4
2 8
3 14
4 24
5 34
6 46
7 62
8 78
9 96
10 118
11 140
12 164
13 192
14 220
15 250
16 284
17 318
18 354
19 394
20 434
21 476
22 522
23 568
24 616
25 668
26 720
27 774
28 832
29 890
30 950
31 1014
32 1078
33 1144
34 1214
35 1284
36 1356
37 1432
38 1508
39 1586
40 1668
41 1750
42 1834
43 1922
44 2010
45 2100
46 2194
47 2288
48 2384
49 2484
50 2584
51 2686
52 2792

List of values

[4, 8, 14, 24, 34, 46, 62, 78, 96, 118, 140, 164, 192, 220, 250, 284, 318, 354, 394, 434, 476, 522, 568, 616, 668, 720, 774, 832, 890, 950, 1014, 1078, 1144, 1214, 1284, 1356, 1432, 1508, 1586, 1668, 1750, 1834, 1922, 2010, 2100, 2194, 2288, 2384, 2484, 2584, 2686, 2792]