Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 14 2019 23:11:35
%S 0,0,0,0,2,19,47,63,80,99,120,143,168,195,224,255,288,323,360,399,440,
%T 483,528,575,624,675,728,783,840
%N Longest path length in the n X n fiveleaper graph.
%C 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).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FiveleaperGraph.html">Fiveleaper Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LongestPath.html">Longest Path</a>
%F Conjectures from _Colin Barker_, Jun 14 2019: (Start)
%F G.f.: x^5*(2 + 13*x - 4*x^2 - 23*x^3 + 13*x^4 + x^5) / (1 - x)^3.
%F a(n) = n^2 - 1 for n>7.
%F (End)
%Y Cf. A307553 (number of longest paths).
%K nonn,more
%O 1,5
%A _Eric W. Weisstein_, Apr 14 2019