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.

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

This page as a plain text file.
%I A207759 #7 Jul 22 2025 20:48:19
%S A207759 13,169,493,1664,6552,21547,67330,217902,687672,2108870,6459569,
%T A207759 19653779,59068262,176517135,525307673,1554420841,4579979219,
%U A207759 13453583712,39397940890,115063670433,335345658200,975522972020,2833090734366
%N A207759 Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.
%C A207759 Column 5 of A207762
%H A207759 R. H. Hardin, <a href="/A207759/b207759.txt">Table of n, a(n) for n = 1..210</a>
%F A207759 Empirical: a(n) = 7*a(n-1) -18*a(n-2) +42*a(n-3) -135*a(n-4) +245*a(n-5) -331*a(n-6) +828*a(n-7) -1162*a(n-8) +899*a(n-9) -2506*a(n-10) +2983*a(n-11) -933*a(n-12) +5079*a(n-13) -5361*a(n-14) -397*a(n-15) -7067*a(n-16) +6470*a(n-17) +2910*a(n-18) +6260*a(n-19) -5476*a(n-20) -3504*a(n-21) -3776*a(n-22) +3472*a(n-23) +1984*a(n-24) +1120*a(n-25) -1184*a(n-26) -576*a(n-27) -128*a(n-28) +256*a(n-29) for n>31
%e A207759 Some solutions for n=4
%e A207759 ..0..0..1..0..0....0..0..1..1..0....1..0..0..1..1....1..0..0..1..0
%e A207759 ..0..1..1..0..0....0..1..1..0..0....1..0..0..1..0....0..0..1..0..0
%e A207759 ..0..0..1..0..0....0..0..1..0..0....0..0..1..1..0....0..1..0..0..1
%e A207759 ..1..0..0..1..0....1..0..0..1..0....0..1..0..0..1....1..0..0..1..0
%K A207759 nonn
%O A207759 1,1
%A A207759 _R. H. Hardin_ Feb 19 2012