Number of non-isomorphic directed graphs reachable in n steps (and no fewer) by at least 2*n agents using the LNS protocol (see A307085).
A383388
Number of non-isomorphic directed graphs reachable in n steps (and no fewer) by at least 2*n agents using the LNS protocol (see A307085).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =7a(4) =25a(5) =120a(6) =709a(7) =4892a(8) =38551a(9) =338339a(10) =3261255
External references
- oeis: A383388