OFFSET
0,3
COMMENTS
The length is defined as the number of edges along the path, so the number of nodes of the longest path is a(n)+1.
FORMULA
a(n) <= A099155(n).
EXAMPLE
For n <= 4, the only induced paths between two antipodal nodes are the shortest paths, so a(n) = n.
For n = 5, a longest induced path is 00000 - 10000 - 11000 - 11100 - 01100 - 01110 - 00110 - 00111 - 00011 - 10011 - 11011 - 11111, so a(5) = 11.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Pontus von Brömssen, Sep 25 2022
STATUS
approved