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).

1, 1, 2, 7, 26, 126, 758, 5326, 42676, 381551, 3751542

Offset

0,3

Comments

In n steps, no more than 2*n agents can be involved, so A383386(k,n) = a(n) for k >= 2*n > 0.

Links

Table of n, a(n) for n=0..10.

Crossrefs

Cf. A318154, A383386, A383388 (LNS protocol).

Sequence in context: A096803 A036757 A358493 * A341900 A300049 A209005

Adjacent sequences: A383386 A383387 A383388 * A383390 A383391 A383392

Keyword

nonn,more

Author

Pontus von Brömssen, May 06 2025

Status

approved