|
Search: id:A007786
|
|
|
| A007786 |
|
Number of nonintersecting rook paths joining opposite corners of 4 X n board. |
|
+0
5
|
|
| 1, 8, 38, 184, 976, 5382, 29739, 163496, 896476, 4913258, 26932712, 147657866, 809563548, 4438573234, 24335048679, 133419610132, 731487691902, 4010463268476, 21987818897998, 120550710615560, 660932932108467
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Netnews group rec.puzzles, Frequently Asked Questions (FAQ) file. (Science Section).
|
|
LINKS
|
Rook path problem
|
|
FORMULA
|
a(n) = 12*a(n - 1) - 54*a(n - 2) + 124*a(n - 3) - 133*a(n - 4) - 16*a(n - 5) + 175*a(n - 6) - 94*a(n - 7) - 69*a(n - 8) + 40*a(n - 9) + 12*a(n - 10) - 4*a(n - 11) - a(n - 12).
|
|
CROSSREFS
|
Cf. A006192, A007764, A007787.
Adjacent sequences: A007783 A007784 A007785 this_sequence A007787 A007788 A007789
Sequence in context: A026640 A122682 A123518 this_sequence A026662 A003353 A101374
|
|
KEYWORD
|
nonn,easy,nice,walk
|
|
AUTHOR
|
Heiner Marxen
|
|
EXTENSIONS
|
Formula and more terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 20 2000
|
|
|
Search completed in 0.002 seconds
|
