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.

A269095 Number of nX6 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three exactly once.

This page as a plain text file.
%I A269095 #4 Feb 19 2016 09:49:40
%S A269095 1620,889056,300056400,86415197088,22984646281176,5826856525990272,
%T A269095 1430390977786967280,343122372255163660560,80890546793429923552008,
%U A269095 18813147168685841982033408,4328190538478506032118840320
%N A269095 Number of nX6 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three exactly once.
%C A269095 Column 6 of A269097.
%H A269095 R. H. Hardin, <a href="/A269095/b269095.txt">Table of n, a(n) for n = 1..210</a>
%F A269095 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 A269095 Some solutions for n=1
%e A269095 ..2..0..2..1..0..2. .1..3..1..2..3..1. .0..1..0..0..3..1. .0..3..3..1..1..0
%Y A269095 Cf. A269097.
%K A269095 nonn
%O A269095 1,1
%A A269095 _R. H. Hardin_, Feb 19 2016