Number of circulant graphs on n vertices up to Cayley isomorphism.

Terms

a(0) =1a(1) =2a(2) =2a(3) =4a(4) =3a(5) =8a(6) =4a(7) =12a(8) =8a(9) =20a(10) =8a(11) =48a(12) =14a(13) =48a(14) =44a(15) =88a(16) =36a(17) =192a(18) =60a(19) =336a(20) =200a(21) =416a(22) =188a(23) =1344a(24) =424a(25) =1400a(26) =944a(27) =3104a(28) =1182a(29) =8768