Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099945
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099945 Number of 4 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
188, 404, 836, 1700, 3428, 6884, 13796, 27620, 55268, 110564, 221156, 442340, 884708, 1769444, 3538916, 7077860, 14155748, 28311524, 56623076, 113246180, 226492388, 452984804, 905969636, 1811939300, 3623878628, 7247757284 (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

27*2^n-28

CROSSREFS

Cf. A000105.

Sequence in context: A015986 A065212 A044998 this_sequence A073586 A064115 A089273

Adjacent sequences: A099942 A099943 A099944 this_sequence A099946 A099947 A099948

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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research