This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099943 Number of 5 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01,1) and (11;0). 0
 72, 98, 124, 150, 176, 202, 228, 254, 280, 306, 332, 358, 384, 410, 436, 462, 488, 514, 540, 566, 592, 618, 644, 670, 696, 722, 748, 774, 800, 826, 852, 878, 904, 930, 956, 982, 1008, 1034, 1060, 1086, 1112, 1138, 1164, 1190, 1216, 1242, 1268, 1294, 1320 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS 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 i11 and n>1. 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. Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = 26*n + 20. MATHEMATICA Range[72, 7000, 26] (* Vladimir Joseph Stephan Orlovsky, Jul 13 2011 *) CROSSREFS Cf. A016957 (m=2), A008592 (m=3), A063130 (m=4). Sequence in context: A245213 A270308 A271329 * A118218 A242186 A205189 Adjacent sequences:  A099940 A099941 A099942 * A099944 A099945 A099946 KEYWORD nonn AUTHOR Sergey Kitaev (kitaev(AT)ms.uky.edu), Nov 12 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 04:04 EST 2018. Contains 318158 sequences. (Running on oeis4.)