login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307552 Number of longest paths in the n X n antelope graph. 1
0, 0, 0, 0, 4, 4, 24, 1872, 253248 (list; graph; refs; listen; history; text; internal format)
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

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

Eric Weisstein's World of Mathematics, Antelope Graph

Eric Weisstein's World of Mathematics, Longest Path

CROSSREFS

Cf. A307459 (longest path lengths).

Sequence in context: A092897 A269152 A269097 * A171633 A221276 A117429

Adjacent sequences:  A307549 A307550 A307551 * A307553 A307554 A307555

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Apr 13 2019

EXTENSIONS

a(9) from Bert Dobbelaere, Apr 15 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 09:52 EST 2020. Contains 338876 sequences. (Running on oeis4.)