login
A078780
Number of different digraphs on an n-cube.
1
1, 1, 4, 112, 11223994, 314824455746718261696, 136221825854745676520057815453547961471533176827330560
OFFSET
0,3
COMMENTS
There are 2^(E(n)) directed graphs on the E(n)=n2^(n-1) edges of an n-cube, but many of these are equivalent under symmetries. This sequence gives the number of structurally different digraphs on the n-cube, i.e. the number of equivalence classes generated by the symmetries.
LINKS
Pontus von Brömssen, Table of n, a(n) for n = 0..7
R. Edwards and L. Glass, Combinatorial explosion in model gene networks, Chaos, Vol. 10 (2000), pp. 691-704.
CROSSREFS
Sequence in context: A262261 A085522 A263416 * A041377 A103499 A298331
KEYWORD
nonn
AUTHOR
Roderick Edwards (edwards(AT)math.uvic.ca), Jan 09 2003
EXTENSIONS
a(0) prepended by Pontus von Brömssen, Mar 30 2022
STATUS
approved