Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).

A059282

Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).

Terms

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

External references