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.

A268778 Number of nX5 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 A268778 #4 Feb 13 2016 09:46:39
%S A268778 23,148,1031,6383,38483,224960,1288693,7271509,40511381,223527424,
%T A268778 1223021243,6646278717,35903716877,192977652868,1032630435883,
%U A268778 5504232072227,29238119105311,154834459041646,817685821067843
%N A268778 Number of nX5 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two no more than once.
%C A268778 Column 5 of A268781.
%H A268778 R. H. Hardin, <a href="/A268778/b268778.txt">Table of n, a(n) for n = 1..210</a>
%F A268778 Empirical: a(n) = 4*a(n-1) +28*a(n-2) -62*a(n-3) -314*a(n-4) +78*a(n-5) +867*a(n-6) +6*a(n-7) -859*a(n-8) +46*a(n-9) +215*a(n-10) -8*a(n-11) -16*a(n-12)
%e A268778 Some solutions for n=4
%e A268778 ..1..1..0..1..0. .1..1..0..0..0. .1..1..0..0..1. .0..1..0..0..0
%e A268778 ..0..0..0..0..0. .0..0..0..0..1. .0..0..0..0..0. .0..0..0..1..1
%e A268778 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0
%e A268778 ..0..0..1..0..0. .1..0..1..0..0. .0..1..0..0..0. .0..0..0..0..1
%Y A268778 Cf. A268781.
%K A268778 nonn
%O A268778 1,1
%A A268778 _R. H. Hardin_, Feb 13 2016