Number of (not necessarily connected) edge-transitive simple graphs on n vertices.
A095352
Number of (not necessarily connected) edge-transitive simple graphs on n vertices.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =8a(4) =12a(5) =21a(6) =26a(7) =38a(8) =49a(9) =67a(10) =74a(11) =105a(12) =115a(13) =137a(14) =168a(15) =206a(16) =218a(17) =264a(18) =276a(19) =340a(20) =384a(21) =416a(22) =429a(23) =533a(24) =571a(25) =613a(26) =675a(27) =764a(28) =782a(29) =926
External references
- oeis: A095352