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

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 5, 6, 1, 1, 2, 6, 18, 41, 28, 1, 1, 2, 7, 23, 97, 353, 676, 367, 22, 2, 1, 1, 2, 7, 24, 113, 608, 3053, 10791, 19500, 12625, 2192, 128, 1, 1, 1, 2, 7, 25, 118, 685, 4438, 28426, 148891, 525385, 1012956, 875486, 290254, 35413, 1166, 6

Offset

1,10

Links

Table of n, a(n) for n=1..61.

Formula

T(n,k) = A383388(k) for n >= 2*k > 0.

Example

Triangle begins:
  n\k| 0  1  2  3  4  5   6   7   8  9 10
  ---+-----------------------------------
  1  | 1
  2  | 1  1
  3  | 1  1  1  1
  4  | 1  1  2  5  6
  5  | 1  1  2  6 18 41  28
  6  | 1  1  2  7 23 97 353 676 367 22  2

Crossrefs

Cf. A307085 (row sums), A383386 (ANY protocol), A383387, A383388.

Sequence in context: A196550 A011037 A111987 * A004650 A138279 A131800

Adjacent sequences: A383382 A383383 A383384 * A383386 A383387 A383388

Keyword

nonn,tabf

Author

Pontus von Brömssen, May 06 2025

Status

approved