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.

A268779 Number of nX6 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two no more than once.

This page as a plain text file.
%I A268779 #4 Feb 13 2016 09:47:24
%S A268779 41,343,3354,27531,224960,1755113,13493468,101738555,758303322,
%T A268779 5590121407,40870469356,296640792103,2140108184248,15358691305417,
%U A268779 109723986174308,780748875032869,5535897115345958,39128843941494495
%N A268779 Number of nX6 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two no more than once.
%C A268779 Column 6 of A268781.
%H A268779 R. H. Hardin, <a href="/A268779/b268779.txt">Table of n, a(n) for n = 1..210</a>
%F A268779 Empirical: a(n) = 6*a(n-1) +51*a(n-2) -214*a(n-3) -1074*a(n-4) +2018*a(n-5) +7713*a(n-6) -10572*a(n-7) -22926*a(n-8) +30116*a(n-9) +25283*a(n-10) -32400*a(n-11) -15148*a(n-12) +15184*a(n-13) +5660*a(n-14) -2688*a(n-15) -1024*a(n-16)
%e A268779 Some solutions for n=4
%e A268779 ..0..0..0..0..0..0. .0..0..0..1..1..0. .0..0..0..0..0..0. .0..0..0..0..0..0
%e A268779 ..0..0..1..0..0..1. .1..0..0..0..0..0. .0..1..0..1..0..1. .0..0..0..1..0..0
%e A268779 ..1..0..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..0. .0..0..0..0..0..1
%e A268779 ..0..0..1..0..1..0. .1..0..0..0..1..0. .1..0..0..0..1..0. .1..0..1..0..0..0
%Y A268779 Cf. A268781.
%K A268779 nonn
%O A268779 1,1
%A A268779 _R. H. Hardin_, Feb 13 2016