Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k steps (and no fewer) by n agents using the LNS protocol (see A307085); n >= 1, 0 <= k <= A383387(n).

A383385

Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k steps (and no fewer) by n agents using the LNS protocol (see A307085); n >= 1, 0 <= k <= A383387(n).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =2a(10) =5a(11) =6a(12) =1a(13) =1a(14) =2a(15) =6a(16) =18a(17) =41a(18) =28a(19) =1a(20) =1a(21) =2a(22) =7a(23) =23a(24) =97a(25) =353a(26) =676a(27) =367a(28) =22a(29) =2

External references