|
| |
|
|
A302131
|
|
Number of (undirected) paths in the n-triangular honeycomb obtuse knight graph.
|
|
0
|
| |
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Table of n, a(n) for n=1..7.
Stan Wagon, Graph Theory Problems from Hexagonal and Traditional Chess, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287.
Eric Weisstein's World of Mathematics, Graph Path
|
|
|
CROSSREFS
|
Sequence in context: A195888 A162084 A195518 * A051848 A238561 A290574
Adjacent sequences: A302128 A302129 A302130 * A302132 A302133 A302134
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
Eric W. Weisstein, Apr 02 2018
|
|
|
STATUS
|
approved
|
| |
|
|
