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.

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

This page as a plain text file.
%I A269107 #4 Feb 19 2016 13:45:56
%S A269107 2592,1090740,342055548,95166487524,24808345933548,6206909793496236,
%T A269107 1509593256271433868,359627971978314972756,84330282164848323860700,
%U A269107 19529981463869576058830652,4477577440675705031339912748
%N A269107 Number of nX6 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once.
%C A269107 Column 6 of A269109.
%H A269107 R. H. Hardin, <a href="/A269107/b269107.txt">Table of n, a(n) for n = 1..210</a>
%F A269107 Empirical: a(n) = 624*a(n-1) -148392*a(n-2) +17707654*a(n-3) -1237692774*a(n-4) +55270649556*a(n-5) -1656470723141*a(n-6) +34132157660412*a(n-7) -484096890617541*a(n-8) +4569992373952272*a(n-9) -25146261177957786*a(n-10) +25694778316842858*a(n-11) +756190434082200840*a(n-12) -6052462771631752224*a(n-13) +18126128855859433455*a(n-14) +18664609483184919500*a(n-15) -342070453287924453888*a(n-16) +1141375792492508055684*a(n-17) -1231488788816842507708*a(n-18) -2418565901590843869576*a(n-19) +9095171580512370570684*a(n-20) -8677540039273932904920*a(n-21) -4965678440542161492372*a(n-22) +17155105764294227912496*a(n-23) -13588702943203699236720*a(n-24) +4184136771765648014016*a(n-25) -441364595341874186304*a(n-26) for n>27
%e A269107 Some solutions for n=1
%e A269107 ..1..0..0..1..3..1. .3..1..3..1..0..1. .1..0..0..1..3..3. .0..0..1..3..2..2
%Y A269107 Cf. A269109.
%K A269107 nonn
%O A269107 1,1
%A A269107 _R. H. Hardin_, Feb 19 2016