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.

A268636 Number of nX5 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.

This page as a plain text file.
%I A268636 #4 Feb 09 2016 12:21:32
%S A268636 96,1944,29772,412740,5419992,68710116,849572724,10310685036,
%T A268636 123340687488,1458578214948,17087534233740,198629587902636,
%U A268636 2293776106412328,26339884438238244,300996939426028068
%N A268636 Number of nX5 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.
%C A268636 Column 5 of A268639.
%H A268636 R. H. Hardin, <a href="/A268636/b268636.txt">Table of n, a(n) for n = 1..210</a>
%F A268636 Empirical: a(n) = 32*a(n-1) -386*a(n-2) +2264*a(n-3) -7265*a(n-4) +13512*a(n-5) -14960*a(n-6) +9872*a(n-7) -3776*a(n-8) +768*a(n-9) -64*a(n-10)
%e A268636 Some solutions for n=3
%e A268636 ..1..2..2..2..1. .1..0..0..0..0. .0..1..2..2..2. .1..2..1..0..1
%e A268636 ..0..1..0..1..2. .2..1..0..1..0. .1..2..2..2..1. .2..2..2..2..2
%e A268636 ..1..0..1..2..1. .0..0..1..0..0. .1..2..2..2..2. .1..2..1..2..2
%Y A268636 Cf. A268639.
%K A268636 nonn
%O A268636 1,1
%A A268636 _R. H. Hardin_, Feb 09 2016