|
%I #5 Mar 31 2012 12:36:48
%S 9253,172197,3157010,57262144,1044865367,19045287529,347030298362,
%T 6325139804762,115276893817821,2100921552416129,38289856014452302,
%U 697839603278397490,12718251853368355369,231792595465614884173
%N Number of (n+2)X5 binary arrays with no more than two of any consecutive three bits set in any row or column
%C Column 3 of A202471
%H R. H. Hardin, <a href="/A202466/b202466.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) +111*a(n-2) +2014*a(n-3) +6557*a(n-4) +16985*a(n-5) -300395*a(n-6) -493842*a(n-7) -3268704*a(n-8) +24359757*a(n-9) -12644117*a(n-10) +245975711*a(n-11) -1125487262*a(n-12) +1522045563*a(n-13) -8087124133*a(n-14) +26777225059*a(n-15) -37534618180*a(n-16) +126433919538*a(n-17) -328489679534*a(n-18) +391815137702*a(n-19) -986011308148*a(n-20) +2122690461724*a(n-21) -1946484646192*a(n-22) +3965682502748*a(n-23) -7576159630469*a(n-24) +5031247471425*a(n-25) -9030564869781*a(n-26) +16603266615558*a(n-27) -7654100893731*a(n-28) +12605001997031*a(n-29) -23568791472338*a(n-30) +7284025623281*a(n-31) -11592415733849*a(n-32) +22376915552667*a(n-33) -4108143304538*a(n-34) +7534067585378*a(n-35) -14586401994989*a(n-36) +851438613707*a(n-37) -3651106111783*a(n-38) +6680505527134*a(n-39) +516890844951*a(n-40) +1330578342773*a(n-41) -2180316021478*a(n-42) -457849189081*a(n-43) -350426435259*a(n-44) +504531345207*a(n-45) +156767801632*a(n-46) +63587131764*a(n-47) -80543670710*a(n-48) -29202619778*a(n-49) -7801427038*a(n-50) +8520515392*a(n-51) +3153222478*a(n-52) +630256472*a(n-53) -563860143*a(n-54) -184231091*a(n-55) -26381427*a(n-56) +24372940*a(n-57) +5813919*a(n-58) +360687*a(n-59) -727057*a(n-60) -95650*a(n-61) +8776*a(n-62) +14851*a(n-63) +693*a(n-64) -335*a(n-65) -184*a(n-66) -a(n-67) +3*a(n-68) +a(n-69)
%e Some solutions for n=1
%e ..0..0..0..0..1....1..1..0..0..0....1..0..0..1..0....0..1..0..0..0
%e ..1..0..0..1..1....0..0..0..0..0....0..1..1..0..0....1..0..0..0..1
%e ..0..0..0..0..0....0..1..0..1..0....1..0..1..0..0....0..0..0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 19 2011
| 