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.

A268797 Number of nX7 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.

This page as a plain text file.
%I A268797 #4 Feb 13 2016 13:45:04
%S A268797 576,4360,41248,561116,7801688,104971262,1384570516,17967375416,
%T A268797 230262982692,2921020155826,36745483472428,459003330021886,
%U A268797 5699362152372404,70403795917829390,865796392149477244
%N A268797 Number of nX7 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.
%C A268797 Column 7 of A268798.
%H A268797 R. H. Hardin, <a href="/A268797/b268797.txt">Table of n, a(n) for n = 1..210</a>
%H A268797 R. H. Hardin, <a href="/A268797/a268797.txt">Empirical recurrence of order 68</a>
%F A268797 Empirical recurrence of order 68 (see link above)
%e A268797 Some solutions for n=3
%e A268797 ..2..2..1..2..2..2..2. .1..2..2..2..2..1..2. .2..2..2..1..1..2..2
%e A268797 ..1..2..2..2..1..2..1. .2..1..2..2..2..2..2. .1..2..2..2..2..2..2
%e A268797 ..2..1..2..1..2..2..2. .1..2..2..2..1..2..2. .2..1..2..2..2..1..2
%Y A268797 Cf. A268798.
%K A268797 nonn
%O A268797 1,1
%A A268797 _R. H. Hardin_, Feb 13 2016