|
Search: id:A016933
|
|
| |
|
| 2, 8, 14, 20, 26, 32, 38, 44, 50, 56, 62, 68, 74, 80, 86, 92, 98, 104, 110, 116, 122, 128, 134, 140, 146, 152, 158, 164, 170, 176, 182, 188, 194, 200, 206, 212, 218, 224, 230, 236, 242, 248, 254, 260, 266, 272, 278
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) 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 same relative order as those in the triple (x,y,z). - Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 11 2004
A008615(a(n)) = n+1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 27 2008
|
|
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.
S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, University of Kentucky Research Reports (2004).
|
|
MAPLE
|
a[1]:=2:for n from 2 to 100 do a[n]:=a[n-1]+6 od: seq(a[n], n=1..47); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008
|
|
CROSSREFS
|
Cf. A008588, A016921, A016945, A016957, A016969.
Sequence in context: A105610 A117104 A082933 this_sequence A101959 A133229 A046940
Adjacent sequences: A016930 A016931 A016932 this_sequence A016934 A016935 A016936
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
