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.

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

This page as a plain text file.
%I A207679 #7 Jul 22 2025 20:39:45
%S A207679 13,169,336,964,2310,4728,9450,18940,37656,70916,136496,259444,485812,
%T A207679 917072,1704676,3183548,5913532,10932836,20269368,37337548,68861592,
%U A207679 126762078,232800870,427869304,784395562,1438074950,2634363880
%N A207679 Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically.
%C A207679 Column 5 of A207682
%H A207679 R. H. Hardin, <a href="/A207679/b207679.txt">Table of n, a(n) for n = 1..210</a>
%F A207679 Empirical: a(n) = -a(n-1) +3*a(n-2) +11*a(n-3) +6*a(n-4) -16*a(n-5) -43*a(n-6) -28*a(n-7) +30*a(n-8) +89*a(n-9) +66*a(n-10) -28*a(n-11) -109*a(n-12) -93*a(n-13) +17*a(n-14) +89*a(n-15) +82*a(n-16) -5*a(n-17) -55*a(n-18) -44*a(n-19) -2*a(n-20) +26*a(n-21) +14*a(n-22) +a(n-23) -8*a(n-24) -2*a(n-25) +a(n-27) for n>32
%e A207679 Some solutions for n=4
%e A207679 ..1..1..0..0..1....0..0..1..1..0....1..0..0..1..1....0..1..1..1..0
%e A207679 ..1..1..1..1..1....1..1..1..0..0....0..0..1..0..0....0..1..0..0..1
%e A207679 ..0..0..1..0..0....1..0..0..1..0....1..0..0..1..0....0..0..1..0..0
%e A207679 ..0..1..0..0..1....0..0..1..0..0....1..0..0..1..0....0..1..1..0..0
%K A207679 nonn
%O A207679 1,1
%A A207679 _R. H. Hardin_ Feb 19 2012