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!)
A239179 Number of (1+1) X (n+1) 0..2 arrays with no element greater than all horizontal neighbors or equal to all vertical neighbors. 1

%I #8 Oct 25 2018 11:53:12

%S 6,26,98,378,1512,6018,23890,94846,376670,1495888,5940530,23591238,

%T 93686602,372052590,1477512180,5867563418,23301534646,92536114306,

%U 367483625614,1459367686212,5795507324598,23015382256774,91399732715398

%N Number of (1+1) X (n+1) 0..2 arrays with no element greater than all horizontal neighbors or equal to all vertical neighbors.

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

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

%F Empirical g.f.: 2*x*(3 + x - 3*x^3 + x^4) / (1 - 4*x + x^2 - 3*x^3 - 3*x^4 + 4*x^5 - x^6). - _Colin Barker_, Oct 25 2018

%e Some solutions for n=5:

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

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

%Y Row 1 of A239178.

%K nonn

%O 1,1

%A _R. H. Hardin_, Mar 11 2014

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 August 14 08:37 EDT 2024. Contains 375159 sequences. (Running on oeis4.)