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

A351822

a(n) is the number of different 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) =7a(7) =21a(8) =61a(9) =184a(10) =573a(11) =1835a(12) =5969a(13) =19715a(14) =66054a(15) =223971a(16) =767174a(17) =2651771a(18) =9240766a(19) =32436016a(20) =114596715a(21) =407263306a(22) =1455145050a(23) =5224710466a(24) =18843677124a(25) =68243466611a(26) =248090964092a(27) =905092211818

External references