a(n) is the number of self-complementary score sequences that are possible for strong tournaments on n vertices.

A351869

a(n) is the number of self-complementary score sequences that are possible for strong tournaments on n vertices.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =3a(6) =3a(7) =9a(8) =11a(9) =30a(10) =39a(11) =103a(12) =141a(13) =363a(14) =514a(15) =1301a(16) =1894a(17) =4727a(18) =7036a(19) =17358a(20) =26311a(21) =64282a(22) =98936a(23) =239712a(24) =373806a(25) =899115a(26) =1418130a(27) =3389078a(28) =5399133a(29) =12828749

External references