cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A207586 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.

This page as a plain text file.
%I A207586 #7 Jul 22 2025 20:37:08
%S A207586 16,256,324,1098,3094,7272,18150,46716,116932,285200,697034,1720944,
%T A207586 4216816,10262124,25016808,61035720,148655892,361558434,879459498,
%U A207586 2139482884,5202203050,12645158420,30736681900,74709969008,181571105898
%N A207586 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.
%C A207586 Column 5 of A207589
%H A207586 R. H. Hardin, <a href="/A207586/b207586.txt">Table of n, a(n) for n = 1..210</a>
%F A207586 Empirical: a(n) = a(n-1) +a(n-2) +16*a(n-3) -8*a(n-4) -a(n-5) -125*a(n-6) +12*a(n-7) -59*a(n-8) +561*a(n-9) +15*a(n-10) +394*a(n-11) -1588*a(n-12) -30*a(n-13) -1252*a(n-14) +3110*a(n-15) -240*a(n-16) +2220*a(n-17) -4681*a(n-18) +1113*a(n-19) -2172*a(n-20) +5890*a(n-21) -2305*a(n-22) +689*a(n-23) -6463*a(n-24) +2868*a(n-25) +1071*a(n-26) +5999*a(n-27) -2424*a(n-28) -1723*a(n-29) -4358*a(n-30) +1491*a(n-31) +1167*a(n-32) +2335*a(n-33) -642*a(n-34) -411*a(n-35) -928*a(n-36) +157*a(n-37) +60*a(n-38) +289*a(n-39) -3*a(n-40) +6*a(n-41) -71*a(n-42) -9*a(n-43) -3*a(n-44) +12*a(n-45) +2*a(n-46) -a(n-48) for n>50
%e A207586 Some solutions for n=4
%e A207586 ..1..1..1..0..0....0..1..1..0..0....1..1..0..1..0....1..0..1..0..0
%e A207586 ..0..1..0..1..1....1..0..1..1..1....1..0..1..0..0....0..1..0..1..1
%e A207586 ..1..0..1..0..1....0..1..0..1..0....0..1..0..1..0....1..0..1..0..1
%e A207586 ..1..0..1..1..0....0..1..1..0..0....1..0..1..1..0....0..1..0..1..0
%K A207586 nonn
%O A207586 1,1
%A A207586 _R. H. Hardin_ Feb 19 2012