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.

A268747 Number of nX5 binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.

This page as a plain text file.
%I A268747 #4 Feb 12 2016 12:31:55
%S A268747 23,244,2615,26334,255651,2425799,22577073,207252725,1880654551,
%T A268747 16909709308,150867667407,1337324783132,11788337576943,
%U A268747 103412756868981,903363696442081,7862056896605875,68198486775427551,589834799847933624
%N A268747 Number of nX5 binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.
%C A268747 Column 5 of A268750.
%H A268747 R. H. Hardin, <a href="/A268747/b268747.txt">Table of n, a(n) for n = 1..210</a>
%F A268747 Empirical: a(n) = 8*a(n-1) +56*a(n-2) -288*a(n-3) -1506*a(n-4) +870*a(n-5) +7568*a(n-6) -1632*a(n-7) -15481*a(n-8) +4624*a(n-9) +13495*a(n-10) -6192*a(n-11) -4336*a(n-12) +2890*a(n-13) +82*a(n-14) -288*a(n-15) +24*a(n-16) +8*a(n-17) -a(n-18)
%e A268747 Some solutions for n=4
%e A268747 ..0..1..0..0..1. .1..0..0..0..0. .0..1..0..1..0. .0..0..0..1..0
%e A268747 ..1..0..0..1..0. .0..1..0..0..0. .0..0..0..0..1. .0..0..0..1..0
%e A268747 ..0..0..0..0..1. .0..0..0..0..1. .1..0..0..0..1. .0..0..0..0..1
%e A268747 ..1..0..1..1..0. .1..0..0..0..0. .0..0..0..0..0. .0..1..0..0..0
%Y A268747 Cf. A268750.
%K A268747 nonn
%O A268747 1,1
%A A268747 _R. H. Hardin_, Feb 12 2016