

A307025


Number of (undirected) paths in the m X n knight graph (triangle read by rows with m = 1..n and n = 1..).


0



0, 0, 0, 0, 2, 56, 0, 4, 374, 14980, 0, 8, 2664, 302844, 19005336, 0, 12, 17556, 6530656, 1248702804, 278982789260, 0, 18, 121838, 151793054
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


LINKS



FORMULA

a(1, n) = 0.
a(2, n) = (1  (1)^n + 2*n*(n  2))/4 for n > 1.


EXAMPLE

0;
0, 0;
0, 2, 56;
0, 4, 374, 14980;
0, 8, 2664, 302844, 19005336;
0, 12, 17556, 6530656, 1248702804, 278982789260;
0, 18, 121838, 151793054, ...;


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



