login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A308280
Number of (undirected) Hamiltonian paths in the n-triangular honeycomb obtuse knight graph.
0
0, 0, 0, 0, 0, 168, 0, 1476036
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,6
LINKS
Table of n, a(n) for n=1..8.
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,
Hamiltonian Path
CROSSREFS
Sequence in context:
A012021
A175558
A289743
*
A259086
A062518
A038823
Adjacent sequences:
A308277
A308278
A308279
*
A308281
A308282
A308283
KEYWORD
nonn
,
more
AUTHOR
Eric W. Weisstein
, May 18 2019
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified July 30 23:49 EDT 2024. Contains 374771 sequences. (Running on oeis4.)