Smallest number of nodes in a graph whose automorphism group is cyclic of order n.

A058890

Smallest number of nodes in a graph whose automorphism group is cyclic of order n.

Terms

    a(0) =0a(1) =2a(2) =9a(3) =10a(4) =15a(5) =11a(6) =14a(7) =14a(8) =15a(9) =17a(10) =22a(11) =18a(12) =26a(13) =16a(14) =21a(15) =22a(16) =34a(17) =17a(18) =38a(19) =25a(20) =23a(21) =24a(22) =46a(23) =22a(24) =35a(25) =28a(26) =33a(27) =24a(28) =58a(29) =23

External references