Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of edges in H_n.

A370979

Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of edges in H_n.

Terms

    a(0) =1a(1) =4a(2) =21a(3) =20a(4) =135a(5) =144a(6) =553a(7) =440a(8) =1575a(9) =1460a(10) =3729a(11) =3132a(12) =7527a(13) =6888a(14) =13605a(15) =12016a(16) =23307a(17) =20988a(18) =36385a(19) =32420a(20) =54915a(21) =51216a(22) =79741a(23) =70776a(24) =113175a(25) =105300a(26) =154845a(27) =144508a(28) =206799a(29) =195840

External references