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!)
A316950 Number of nX5 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. 1
3, 383, 9417, 287292, 8641499, 259163370, 7779344498, 233495963949, 7008276669223, 210351107042527, 6313616191484818, 189501015160054908, 5687807789901679332, 170717594048462858014, 5124029853547237364555 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 5 of A316953.
LINKS
FORMULA
Empirical: a(n) = 21*a(n-1) +205*a(n-2) +1729*a(n-3) +6482*a(n-4) +20422*a(n-5) +15722*a(n-6) -68945*a(n-7) -274873*a(n-8) -285347*a(n-9) +262561*a(n-10) +667642*a(n-11) +350411*a(n-12) -1662532*a(n-13) +544892*a(n-14) -570000*a(n-15) +47220*a(n-16) +425272*a(n-17) -1298986*a(n-18) +2146810*a(n-19) -426071*a(n-20) +537568*a(n-21) -381944*a(n-22) -620494*a(n-23) +372655*a(n-24) -275195*a(n-25) +309994*a(n-26) -107697*a(n-27) +64413*a(n-28) -38742*a(n-29) +936*a(n-30) -1920*a(n-31) -816*a(n-32) +288*a(n-33)
EXAMPLE
Some solutions for n=5
..0..0..0..1..0. .0..0..0..1..0. .0..0..0..1..0. .0..0..0..1..0
..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..0..0
..0..0..1..1..0. .0..0..1..1..1. .0..0..1..0..0. .0..0..1..1..0
..0..0..1..0..0. .1..1..0..0..1. .1..1..0..1..0. .0..0..1..1..0
..0..1..0..1..1. .0..1..1..1..1. .1..0..0..1..0. .1..0..0..1..1
CROSSREFS
Cf. A316953.
Sequence in context: A317219 A305689 A317069 * A317730 A193131 A193154
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jul 17 2018
STATUS
approved

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 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)