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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217953 Number of n element 0..3 arrays with each element the minimum of 7 adjacent elements of a random 0..3 array of n+6 elements 1

%I

%S 4,16,50,130,296,610,1163,2083,3558,5902,9734,16410,28969,54049,

%T 105529,211097,423650,840654,1636964,3121556,5839194,10760322,

%U 19647966,35780070,65376302,120393728,223926347,420463887,795087960,1508967508,2864523898

%N Number of n element 0..3 arrays with each element the minimum of 7 adjacent elements of a random 0..3 array of n+6 elements

%C Column 7 of A217954

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

%F Empirical: a(n) = 4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) +6*a(n-8) -4*a(n-9) +6*a(n-10) +4*a(n-11) +5*a(n-12) +6*a(n-13) +7*a(n-14) +8*a(n-15) +4*a(n-16) +6*a(n-17) +5*a(n-18) +4*a(n-19) +3*a(n-20) +2*a(n-21) +a(n-22)

%e Some solutions for n=4

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Oct 15 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 19:11 EDT 2021. Contains 343177 sequences. (Running on oeis4.)