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.

A269139 Number of nX4 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.

This page as a plain text file.
%I A269139 #6 Feb 20 2016 06:48:55
%S A269139 216,8532,275796,8317996,240647068,6766301156,186315931804,
%T A269139 5049212790572,135126561336764,3579710280903028,94040960852579428,
%U A269139 2453204481574556084,63613980689923027716,1641094486943583990844,42147014968744168530996
%N A269139 Number of nX4 0..3 arrays with some element plus some horizontally, antidiagonally or vertically adjacent neighbor totalling three no more than once.
%C A269139 Column 4 of A269143.
%H A269139 R. H. Hardin, <a href="/A269139/b269139.txt">Table of n, a(n) for n = 1..210</a>
%F A269139 Empirical: a(n) = 58*a(n-1) -1093*a(n-2) +7680*a(n-3) -27078*a(n-4) +58958*a(n-5) -88914*a(n-6) +82212*a(n-7) -35159*a(n-8) -20796*a(n-9) +39556*a(n-10) -11364*a(n-11) -13593*a(n-12) +9618*a(n-13) +429*a(n-14) -2060*a(n-15) +434*a(n-16) +166*a(n-17) -92*a(n-18) +16*a(n-19) -a(n-20) for n>22
%e A269139 Some solutions for n=2
%e A269139 ..2..3..2..2. .2..3..1..3. .0..0..1..1. .1..1..3..1. .1..1..0..1
%e A269139 ..2..2..2..3. .3..1..1..2. .0..1..1..0. .0..1..3..3. .0..1..1..3
%Y A269139 Cf. A269143.
%K A269139 nonn
%O A269139 1,1
%A A269139 _R. H. Hardin_, Feb 20 2016