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.

A269287 Number of nX6 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.

This page as a plain text file.
%I A269287 #4 Feb 21 2016 09:25:35
%S A269287 2592,1363572,544118148,193446959076,64538382287988,20680187784811380,
%T A269287 6444304707617709156,1967513283560471350788,591384314583314302090068,
%U A269287 175574678705837994574453140,51607712999525045688100012356
%N A269287 Number of nX6 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.
%C A269287 Column 6 of A269289.
%H A269287 R. H. Hardin, <a href="/A269287/b269287.txt">Table of n, a(n) for n = 1..210</a>
%F A269287 Empirical: a(n) = 564*a(n-1) -87462*a(n-2) +2257724*a(n-3) -21169617*a(n-4) +76236552*a(n-5) -92236816*a(n-6) for n>7
%e A269287 Some solutions for n=2
%e A269287 ..0..0..2..3..1..0. .0..0..0..3..3..2. .0..0..0..0..1..0. .0..0..1..2..0..1
%e A269287 ..2..2..3..1..1..1. .1..0..2..2..0..0. .1..2..2..0..2..2. .1..1..3..1..3..2
%Y A269287 Cf. A269289.
%K A269287 nonn
%O A269287 1,1
%A A269287 _R. H. Hardin_, Feb 21 2016