STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A307552
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing all changes.
STATUS
proposed
reviewed
STATUS
editing
proposed
DATA
0, 0, 0, 0, 4, 4, 24, 1872, 253248
EXTENSIONS
a(9) from Bert Dobbelaere, Apr 15 2019
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
NAME
Longest path length Number of longest paths in the n X n antelope graph.
DATA
0, 0, 0, 0, 2, 4, 23, 544, 24, 1872
CROSSREFS
Cf. A307459 (longest path lengths).
NAME
allocated for Eric W. Weisstein
Longest path length in the n X n antelope graph.
DATA
0, 0, 0, 0, 2, 4, 23, 54
OFFSET
1,5
COMMENTS
The n X n antelope graph is connected for n >= 8 and traceable for n = 14 and 21 (with the status for 20 and 22-25 unknown).
LINKS
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AntelopeGraph.html">Antelope Graph</a>
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LongestPath.html">Longest Path</a>
KEYWORD
allocated
nonn,more
AUTHOR
Eric W. Weisstein, Apr 13 2019
STATUS
approved
editing
NAME
allocated for Eric W. Weisstein
KEYWORD
recycled
allocated
KEYWORD
recycled
STATUS
approved