# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a202465 Showing 1-1 of 1 %I A202465 #5 Mar 31 2012 12:36:48 %S A202465 1573,16561,172197,1774281,18374521,190112777,1966463785,20345296193, %T A202465 210482281689,2177526620233,22527699867037,233060360137857, %U A202465 2411126165020333,24944324990455409,258061639015145685 %N A202465 Number of (n+2)X4 binary arrays with no more than two of any consecutive three bits set in any row or column %C A202465 Column 2 of A202471 %H A202465 R. H. Hardin, Table of n, a(n) for n = 1..210 %F A202465 Empirical: a(n) = 4*a(n-1) +36*a(n-2) +272*a(n-3) +350*a(n-4) +392*a(n-5) -3016*a(n-6) -164*a(n-7) -5522*a(n-8) +11427*a(n-9) -4608*a(n-10) +10140*a(n-11) -11817*a(n-12) +4108*a(n-13) -2432*a(n-14) +1176*a(n-15) -166*a(n-16) +124*a(n-17) -50*a(n-18) +4*a(n-19) -2*a(n-20) +a(n-21) %e A202465 Some solutions for n=2 %e A202465 ..1..0..0..1....0..0..1..1....1..0..1..0....0..1..0..1....1..0..1..0 %e A202465 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..1..1..0 %e A202465 ..1..1..0..1....1..0..1..0....1..0..1..1....1..1..0..0....0..0..0..0 %e A202465 ..0..0..0..1....0..0..0..1....1..0..0..0....1..0..1..1....0..1..0..0 %K A202465 nonn %O A202465 1,1 %A A202465 _R. H. Hardin_ Dec 19 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE