|
|
A095707
|
|
Total number of distinct winning paths across an n X n Hex board.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) ~ (n!)^2 / 2^n.
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 11; 8 of length 3 (cf. A001792) plus 2 of length 4 (cf. A096367) plus 1 of length 5 [a1,a2,b2,c2,c3].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|