|
|
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
|
|
|
FORMULA
|
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).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|