login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100315 Number of 3 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;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+2^n+2(nm-n-m). 2
8, 14, 22, 34, 54, 90, 158, 290, 550, 1066, 2094, 4146, 8246, 16442, 32830, 65602, 131142, 262218, 524366, 1048658, 2097238, 4194394, 8388702, 16777314, 33554534, 67108970, 134217838, 268435570, 536871030, 1073741946, 2147483774, 4294967426, 8589934726 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.

FORMULA

a(n) = a(n) = 2^n+4*n+2

MATHEMATICA

Table[4*n + 2^n + 2, {n, 50}] (* From Vladimir Joseph Stephan Orlovsky, Jul 08 2011 *)

CROSSREFS

Cf. m=2: A100314; m=4: A100316.

Sequence in context: A108058 A191352 A063216 * A001049 A134445 A100508

Adjacent sequences:  A100312 A100313 A100314 * A100316 A100317 A100318

KEYWORD

nonn

AUTHOR

Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 13 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:23 EST 2012. Contains 205945 sequences.