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.

A268638 Number of n X 7 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totaling two exactly once.

This page as a plain text file.
%I A268638 #6 Aug 31 2019 15:50:00
%S A268638 576,25272,875592,27906474,849572724,25093766490,725187096504,
%T A268638 20612084839848,578250487434612,16051896344807322,441734555450215308,
%U A268638 12067989070909055082,327659984810446438932,8849194102430720956704
%N A268638 Number of n X 7 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totaling two exactly once.
%C A268638 Column 7 of A268639.
%H A268638 R. H. Hardin, <a href="/A268638/b268638.txt">Table of n, a(n) for n = 1..210</a>
%F A268638 Empirical: a(n) = 110*a(n-1) -5243*a(n-2) +144650*a(n-3) -2610593*a(n-4) +33017408*a(n-5) -305811128*a(n-6) +2137462184*a(n-7) -11513372884*a(n-8) +48502300256*a(n-9) -161412354008*a(n-10) +427044616576*a(n-11) -901108804624*a(n-12) +1517344261024*a(n-13) -2035022988048*a(n-14) +2164824966496*a(n-15) -1815145078160*a(n-16) +1189730382208*a(n-17) -603502277248*a(n-18) +234173991424*a(n-19) -68574152448*a(n-20) +14906358784*a(n-21) -2352277504*a(n-22) +260550656*a(n-23) -19140608*a(n-24) +835584*a(n-25) -16384*a(n-26).
%e A268638 Some solutions for n=2
%e A268638 ..1..2..1..0..1..0..1. .2..2..0..1..0..1..2. .1..1..0..1..0..1..0
%e A268638 ..0..2..2..1..0..0..0. .1..2..1..2..1..2..1. .0..0..1..0..1..2..1
%Y A268638 Cf. A268639.
%K A268638 nonn
%O A268638 1,1
%A A268638 _R. H. Hardin_, Feb 09 2016