Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095707
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095707 Total number of distinct winning paths across an n X n Hex board. +0
1
1, 3, 11, 54, 365, 3848, 68914 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) ~ (n!)^2 / 2^n.

REFERENCES

D. Bevan, Winning Positions and Optimal Play in the Game of Hex, forthcoming.

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

Cf. A001792, A096367.

Sequence in context: A057325 A054700 A009280 this_sequence A094259 A091845 A020061

Adjacent sequences: A095704 A095705 A095706 this_sequence A095708 A095709 A095710

KEYWORD

nonn

AUTHOR

David Bevan (dbevan(AT)emtex.com), Jul 07 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research