Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100315
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
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 (list; graph; listen)
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

CROSSREFS

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

Sequence in context: A114527 A108058 A063216 this_sequence A001049 A134445 A100508

Adjacent sequences: A100312 A100313 A100314 this_sequence A100316 A100317 A100318

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research