|
| |
|
|
A096367
|
|
Number of winning paths of length n+1 across an n X n Hex board.
|
|
1
| |
|
|
2, 14, 58, 194, 578, 1602, 4226, 10754, 26626, 64514, 153602, 360450, 835586, 1916930, 4358146, 9830402, 22020098, 49020930, 108527618, 239075330, 524288002, 1145044994
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,1
|
|
|
COMMENTS
| If m>n-2, H(m,n) = (2*m+1-n)*2^(n-2) is the number of winning paths of length n across an m X n Hex board (cf. A001792). If m>n-1, H'(m,n) = (n-2)*(H(m-3,n-2) + H(m+1,n-2)) - 2^(n-1) + 2 is the number of winning paths of length n+1 across an m X n Hex board.
|
|
|
FORMULA
| a(n) = (n-2)*(n+1)*2^(n-3)-2^(n-1)+2
|
|
|
EXAMPLE
| a(4)=14.
|
|
|
CROSSREFS
| Cf. A001792.
Sequence in context: A178605 A115027 A114146 * A174704 A058738 A095376
Adjacent sequences: A096364 A096365 A096366 * A096368 A096369 A096370
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| David Bevan (dbevan(AT)emtex.com), Jul 02 2004
|
| |
|
|
