login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The OnLine Encyclopedia of Integer Sequences
!)
A307556
Number of (undirected) longest paths in the n X n bishop graph.
0
0, 2, 4, 192, 25376, 64264704, 1295557991168, 458135084510273536, 2627612220112334649458688
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..9.
Eric Weisstein's World of Mathematics,
Bishop Graph
Eric Weisstein's World of Mathematics,
Longest Path
FORMULA
a(n) =
A234632
(n) for n even.
a(n) =
A234632
(n)/2 for n odd.
CROSSREFS
Cf.
A234632
(number of directed Hamiltonian paths in the n X n black bishop graph).
Sequence in context:
A012367
A165508
A018633
*
A018637
A018647
A009743
Adjacent sequences:
A307553
A307554
A307555
*
A307557
A307558
A307559
KEYWORD
nonn
,
more
AUTHOR
Eric W. Weisstein
, Apr 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 August 6 06:14 EDT 2024. Contains 374960 sequences. (Running on oeis4.)