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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218051 Number of n X 1 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..3 n X 1 array. 5

%I

%S 4,4,16,36,94,236,602,1528,3882,9858,25038,63592,161514,410218,

%T 1041884,2646208,6720920,17069998,43354902,110114102,279671154,

%U 710317326,1804085608,4582071648,11637685314,29557748082,75071670020,190669317026

%N Number of n X 1 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..3 n X 1 array.

%C Column 1 of A218056.

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

%F Empirical: a(n) = 2*a(n-1) + a(n-2) + 2*a(n-4) + a(n-5).

%F Empirical g.f.: 2*x*(2 - 2*x + 2*x^2 - x^4) / (1 - 2*x - x^2 - 2*x^4 - x^5). - _Colin Barker_, Feb 19 2018

%e All solutions for n=3:

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 19 2012

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.

Last modified February 7 15:55 EST 2023. Contains 360127 sequences. (Running on oeis4.)