The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A269106 Number of nX5 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. 1

%I

%S 756,132300,17593092,2085484068,232068730044,24808345933548,

%T 2579398703502996,262780733311913580,26357371124964908460,

%U 2611360040338484328156,256155579492309832819860

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

%C Column 5 of A269109.

%H R. H. Hardin, <a href="/A269106/b269106.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 236*a(n-1) -19546*a(n-2) +707906*a(n-3) -13261621*a(n-4) +137719076*a(n-5) -784626841*a(n-6) +2025590366*a(n-7) +1091882414*a(n-8) -18874661724*a(n-9) +33829878231*a(n-10) +10605114324*a(n-11) -91783964484*a(n-12) +94503314304*a(n-13) -30762353664*a(n-14) for n>15

%e Some solutions for n=2

%e ..2..1..3..1..0. .0..0..0..2..3. .3..3..1..0..1. .0..1..3..3..3

%e ..0..1..1..0..2. .2..0..2..0..2. .2..1..3..1..1. .1..3..1..1..2

%Y Cf. A269109.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 19 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 30 10:08 EDT 2020. Contains 334724 sequences. (Running on oeis4.)