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

%I #4 May 15 2018 13:29:32

%S 16,22,53,179,560,1726,5205,15474,46577,140882,425811,1284730,3876203,

%T 11701804,35329457,106648194,321916587,971745234,2933418071,

%U 8855071730,26730426635,80690036458,243576592865,735277676028,2219559525935

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

%C Column 5 of A304604.

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

%F Empirical: a(n) = 3*a(n-1) +3*a(n-2) -11*a(n-3) +10*a(n-4) +4*a(n-5) -67*a(n-6) +52*a(n-7) +80*a(n-8) -134*a(n-9) +50*a(n-10) +85*a(n-11) -134*a(n-12) +124*a(n-13) +62*a(n-14) -158*a(n-15) +85*a(n-16) -26*a(n-17) -85*a(n-18) +50*a(n-19) -19*a(n-20) +32*a(n-21) -22*a(n-22) +5*a(n-23) +43*a(n-24) -59*a(n-25) +33*a(n-26) +12*a(n-27) -34*a(n-28) +23*a(n-29) -4*a(n-30) -5*a(n-31) +4*a(n-32) -a(n-33) for n>39

%e Some solutions for n=5

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

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

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

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

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

%Y Cf. A304604.

%K nonn

%O 1,1

%A _R. H. Hardin_, May 15 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 April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)