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!)
A219680 Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array. 1

%I #7 Jul 26 2018 13:47:29

%S 3,4,9,19,35,60,98,154,234,345,495,693,949,1274,1680,2180,2788,3519,

%T 4389,5415,6615,8008,9614,11454,13550,15925,18603,21609,24969,28710,

%U 32860,37448,42504,48059,54145,60795,68043,75924,84474,93730,103730,114513

%N Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.

%C Column 2 of A219686.

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

%F Empirical: a(n) = (1/24)*n^4 - (1/4)*n^3 + (47/24)*n^2 - (7/4)*n for n>2.

%F Conjectures from _Colin Barker_, Jul 26 2018: (Start)

%F G.f.: x*(3 - 11*x + 19*x^2 - 16*x^3 + 5*x^4 + 2*x^5 - x^6) / (1 - x)^5.

%F a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>7.

%F (End)

%e All solutions for n=3:

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

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

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

%Y Cf. A219686.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 25 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 00:43 EDT 2024. Contains 375959 sequences. (Running on oeis4.)