Triangle read by rows: T(n,k) = number of connected quartic graphs on n vertices with crossing number k for n >= 1, k >= 0.
A390644
Triangle read by rows: T(n,k) = number of connected quartic graphs on n vertices with crossing number k for n >= 1, k >= 0.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =1a(7) =0a(8) =1a(9) =1a(10) =1a(11) =2a(12) =2a(13) =0a(14) =1a(15) =1a(16) =4a(17) =6a(18) =5a(19) =3a(20) =9a(21) =28a(22) =15a(23) =3a(24) =1a(25) =3a(26) =30a(27) =97a(28) =97a(29) =31
External references
- oeis: A390644