id:A099943 - OEIS Search Results

Search: id:A099943

Displaying 1-1 of 1 results found.

page 1

Number of 5 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01,1), and (11;0). 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 (n+2)*2^(m-1)+2*m*(n-1)-2 for m>1 and n>1.

+0
1

72, 98, 124, 150, 176, 202, 228, 254, 280, 306, 332, 358, 384, 410, 436, 462, 488, 514, 540, 566, 592, 618, 644, 670, 696, 722, 748, 774, 800 (list; graph; listen)

	OFFSET	`2,1`
	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.`
	FORMULA	`a(n) = 26*n + 20`
	CROSSREFS	`Cf. m=2: A016957; m=3: A008592; m=4: A063130.` `Adjacent sequences: A099940 A099941 A099942 this_sequence A099944 A099945 A099946` `Sequence in context: A063922 A063923 A030025 this_sequence A118218 A102562 A072412`
	KEYWORD	`nonn`
	AUTHOR	`Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 12 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research