|
Search: id:A017293
|
|
| |
|
| 2, 12, 22, 32, 42, 52, 62, 72, 82, 92, 102, 112, 122, 132, 142, 152, 162, 172, 182, 192, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 302, 312, 322, 332, 342, 352, 362, 372, 382, 392, 402, 412, 422, 432, 442
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Number of 5 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (11;0) and (01;1). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1<i2, j1<j2, and these elements are in the same relative order as those in the triple (x,y,z). In general, the number of m x n 0-1 matrices in question is given by 2^m+2m(n-1). Cf. m=2: A008574; m=3: A016933; m=4: A022144; m=6: A017569. - Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 13 2004
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
|
|
CROSSREFS
|
Subsequence of A034709, together with A017281, A139222, A139245, A017329, A141277, A139264, A139279 and A139280.
Sequence in context: A053896 A077410 A063599 this_sequence A120672 A108960 A111095
Adjacent sequences: A017290 A017291 A017292 this_sequence A017294 A017295 A017296
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
