|
Search: id:A054418
|
|
|
| A054418 |
|
Number of connected 3 X n binary matrices with rightmost column [1,1,1]', divided by 4. |
|
+0
4
|
|
| 1, 8, 53, 352, 2345, 15624, 104093, 693504, 4620369, 30782536, 205084165, 1366343392, 9103063929, 60647838152, 404057392237, 2691973550848, 17934881869985, 119488539398536, 796074997934037, 5303733776692576
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A connected (0,1) matrix is one where you can get from any black square, i.e. a 1, to any other by chess king moves.
|
|
REFERENCES
|
R. Levy and J. Shapiro, Uniqueness in paint-by-numbers puzzles, preprint, 2000.
|
|
FORMULA
|
a(n)=7a(n-1)-3a(n-2)+5a(n-3).
|
|
CROSSREFS
|
Cf. A054417-A054421.
Adjacent sequences: A054415 A054416 A054417 this_sequence A054419 A054420 A054421
Sequence in context: A099622 A110099 A091870 this_sequence A070928 A085537 A085540
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, May 22 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 23 2000
|
|
|
Search completed in 0.007 seconds
|
