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.

A268748 Number of nX6 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 A268748 #4 Feb 12 2016 12:32:43
%S A268748 41,659,10830,165019,2425799,34732937,487682438,6746117783,
%T A268748 92215499119,1248437108837,16766958502992,223674635599161,
%U A268748 2966748789292217,39154974765661223,514529476985579624,6735601878829825279
%N A268748 Number of nX6 binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.
%C A268748 Column 6 of A268750.
%H A268748 R. H. Hardin, <a href="/A268748/b268748.txt">Table of n, a(n) for n = 1..210</a>
%F A268748 Empirical: a(n) = 16*a(n-1) +60*a(n-2) -1148*a(n-3) -3346*a(n-4) +16272*a(n-5) +36588*a(n-6) -104246*a(n-7) -147989*a(n-8) +349140*a(n-9) +217324*a(n-10) -591448*a(n-11) -19320*a(n-12) +431032*a(n-13) -151921*a(n-14) -73194*a(n-15) +41684*a(n-16) +2552*a(n-17) -3594*a(n-18) +148*a(n-19) +100*a(n-20) -4*a(n-21) -a(n-22)
%e A268748 Some solutions for n=4
%e A268748 ..0..0..1..1..0..0. .1..0..1..0..1..0. .0..0..0..1..0..1. .0..1..0..0..0..1
%e A268748 ..0..1..0..0..0..1. .0..0..0..1..0..0. .0..0..0..1..0..0. .0..0..1..0..1..0
%e A268748 ..0..0..1..0..1..0. .0..1..0..0..0..0. .1..0..0..0..0..0. .0..0..0..1..0..0
%e A268748 ..0..1..0..1..0..0. .0..1..0..0..0..1. .0..0..1..0..1..0. .1..0..1..0..0..1
%Y A268748 Cf. A268750.
%K A268748 nonn
%O A268748 1,1
%A A268748 _R. H. Hardin_, Feb 12 2016