cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Eric W. Weisstein, Mar 20 2019

Keywords

Examples

			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

Cf. A288033 (n X n knight graph).

Formula

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