Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099944
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099944 Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;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 (m+3)*2^(m+n-2)-2^n-2^(m+1)+4 for m>0 and n>2; for n=2 the number is (m+1)*2^m. +0
1
76, 164, 340, 692, 1396, 2804, 5620, 11252, 22516, 45044, 90100, 180212, 360436, 720884, 1441780, 2883572, 5767156, 11534324, 23068660, 46137332, 92274676, 184549364, 369098740, 738197492, 1476394996, 2952790004, 5905580020 (list; graph; listen)
OFFSET

3,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) = 11*2^n-12

CROSSREFS

Cf. A000105.

Sequence in context: A063359 A044327 A044708 this_sequence A044408 A044789 A138855

Adjacent sequences: A099941 A099942 A099943 this_sequence A099945 A099946 A099947

KEYWORD

nonn

AUTHOR

Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 12 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 September 8 08:06 EDT 2008. Contains 143486 sequences.


AT&T Labs Research