login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305337 Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero. 1

%I

%S 16,22,62,267,1185,5296,23348,103641,460756,2046399,9088119,40370825,

%T 179335171,796607658,3538564896,15718586255,69823075114,310158698286,

%U 1377746229561,6120044447583,27185659117549,120760569582498

%N Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero.

%C Column 5 of A305340.

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

%F Empirical: a(n) = 2*a(n-1) +8*a(n-2) +14*a(n-3) +13*a(n-4) -49*a(n-5) -137*a(n-6) -103*a(n-7) -a(n-8) +186*a(n-9) +345*a(n-10) +171*a(n-11) -115*a(n-12) -301*a(n-13) -321*a(n-14) -65*a(n-15) +251*a(n-16) +311*a(n-17) +148*a(n-18) -58*a(n-19) -206*a(n-20) -188*a(n-21) -38*a(n-22) +50*a(n-23) +58*a(n-24) +43*a(n-25) +2*a(n-26) -18*a(n-27) -8*a(n-28) +4*a(n-30) +4*a(n-31) +a(n-32) for n>34

%e Some solutions for n=5

%e ..0..0..0..0..0. .0..0..1..0..0. .0..0..0..0..0. .0..0..0..1..0

%e ..0..0..0..0..0. .0..0..0..0..1. .0..0..0..0..1. .1..0..0..0..0

%e ..0..1..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0

%e ..0..0..0..0..0. .1..1..0..0..1. .0..0..0..0..0. .0..1..0..1..0

%e ..0..0..0..0..0. .1..1..0..0..0. .0..1..0..0..0. .0..0..0..0..0

%Y Cf. A305340.

%K nonn

%O 1,1

%A _R. H. Hardin_, May 30 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 06:43 EDT 2022. Contains 353693 sequences. (Running on oeis4.)