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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307554 Longest path length in the n X n fiveleaper graph. 1
 0, 0, 0, 0, 2, 19, 47, 63, 80, 99, 120, 143, 168, 195, 224, 255, 288, 323, 360, 399, 440, 483, 528, 575, 624, 675, 728, 783, 840 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS The n X n fiveleaper graph is connected for n >=8 and traceable from n = 8 up to at least n = 29, meaning a(n) = n^2 - 1 for a(n) with 8 <= n <= 29 (and probably all larger n). LINKS Eric Weisstein's World of Mathematics, Fiveleaper Graph Eric Weisstein's World of Mathematics, Longest Path FORMULA Conjectures from Colin Barker, Jun 14 2019: (Start) G.f.: x^5*(2 + 13*x - 4*x^2 - 23*x^3 + 13*x^4 + x^5) / (1 - x)^3. a(n) = n^2 - 1 for n>7. (End) CROSSREFS Cf. A307553 (number of longest paths). Sequence in context: A109946 A141067 A296251 * A031911 A136685 A226489 Adjacent sequences:  A307551 A307552 A307553 * A307555 A307556 A307557 KEYWORD nonn,more AUTHOR Eric W. Weisstein, Apr 14 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.

Last modified February 26 11:49 EST 2020. Contains 332279 sequences. (Running on oeis4.)