login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A308142
Number of (undirected) Hamiltonian paths in the n-triangular graph.
0
0, 3, 120, 47760, 256193280, 23408523371520, 43819714229729034240
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..7.
Eric Weisstein's World of Mathematics,
Hamiltonian Path
Eric Weisstein's World of Mathematics,
Triangular Graph
FORMULA
a(n) =
A137892
(n)/2.
CROSSREFS
Cf.
A137892
.
Sequence in context:
A134230
A321109
A307936
*
A289704
A246292
A202768
Adjacent sequences:
A308139
A308140
A308141
*
A308143
A308144
A308145
KEYWORD
nonn
,
hard
,
more
AUTHOR
Eric W. Weisstein
, May 14 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 April 19 08:39 EDT 2024. Contains 371782 sequences. (Running on oeis4.)