Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100316
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100316 Number of 4 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
16, 24, 34, 48, 70, 108, 178, 312, 574, 1092, 2122, 4176, 8278, 16476, 32866, 65640, 131182, 262260, 524410, 1048704, 2097286, 4194444, 8388754, 16777368, 33554590, 67109028, 134217898, 268435632, 536871094, 1073742012 (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) = 2^n + 6*n + 8

CROSSREFS

Cf. m=2: A100314; m=3: A100315.

Sequence in context: A074451 A082803 A163284 this_sequence A036328 A067028 A110893

Adjacent sequences: A100313 A100314 A100315 this_sequence A100317 A100318 A100319

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research