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!)
A305343 Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 5 or 8 king-move adjacent elements, with upper left element zero. 2

%I #4 May 30 2018 17:04:51

%S 5,21,28,77,199,454,1074,2619,6216,14782,35494,84850,202493,484472,

%T 1158594,2768565,6619260,15826963,37833884,90447825,216242881,

%U 516964232,1235890365,2954669861,7063719452,16887142919,40372113631,96517561505

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

%C Column 4 of A305347.

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

%F Empirical: a(n) = 2*a(n-1) +4*a(n-3) -3*a(n-4) -4*a(n-5) +7*a(n-6) -8*a(n-7) +a(n-8) -21*a(n-9) +5*a(n-10) +10*a(n-11) -7*a(n-12) +8*a(n-13) -3*a(n-14) +34*a(n-15) +7*a(n-16) +2*a(n-17) -a(n-18) +5*a(n-20) -16*a(n-21) -12*a(n-22) -17*a(n-23) -3*a(n-25) -4*a(n-26) -4*a(n-27) +a(n-28) +10*a(n-29) +3*a(n-30) +a(n-31) +a(n-32) +3*a(n-33) +2*a(n-34) -a(n-35) -a(n-36) for n>37

%e Some solutions for n=5

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

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

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

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

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

%Y Cf. A305347.

%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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)