Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k >= 0 steps (and no fewer) by n >= 1 agents using the ANY protocol (see A318154).
A383386
Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k >= 0 steps (and no fewer) by n >= 1 agents using the ANY protocol (see A318154).
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) =7a(12) =1a(13) =1a(14) =2a(15) =6a(16) =19a(17) =46a(18) =36a(19) =1a(20) =1a(21) =2a(22) =7a(23) =24a(24) =103a(25) =395a(26) =850a(27) =518a(28) =34a(29) =5
External references
- oeis: A383386