close
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A383387
Maximum number of steps needed to reach a reachable directed graph by n agents using the LNS protocol (see A307085).
2
0, 1, 3, 4, 6, 10, 13, 16
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Apparently, the maximum number of steps is the same for the ANY protocol (A318154).
LINKS
Table of n, a(n) for n=1..8.
CROSSREFS
Cf. A307085, A318154, A383385, A383386.
Sequence in context: A103000 A344516 A392178 * A310001 A310002 A240577
Adjacent sequences: A383384 A383385 A383386 * A383388 A383389 A383390
KEYWORD
nonn,more
AUTHOR
Pontus von Brömssen, May 06 2025
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified May 21 21:07 EDT 2026. Contains 395806 sequences.
License Agreements, Terms of Use, Privacy Policy