Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of curved edges constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections.
A374339
Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of curved edges constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections.
Terms
- a(0) =6a(1) =18a(2) =40a(3) =78a(4) =132a(5) =190a(6) =264a(7) =354a(8) =448a(9) =558a(10) =684a(11) =814a(12) =960a(13) =1122a(14) =1288a(15) =1470a(16) =1668a(17) =1870a(18) =2088a(19) =2322a(20) =2560a(21) =2814a(22) =3084a(23) =3358a(24) =3648a(25) =3954a(26) =4264a(27) =4590a(28) =4932a(29) =5278
External references
- oeis: A374339