Number of non-isomorphic directed graphs reachable in n steps (and no fewer) by at least 2*n agents using the ANY protocol (see A318154).
A383389
Number of non-isomorphic directed graphs reachable in n steps (and no fewer) by at least 2*n agents using the ANY protocol (see A318154).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =7a(4) =26a(5) =126a(6) =758a(7) =5326a(8) =42676a(9) =381551a(10) =3751542
External references
- oeis: A383389