login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A220033
Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 3 X n array.
1
4, 6, 10, 19, 30, 42, 55, 69, 84, 100, 117, 135, 154, 174, 195, 217, 240, 264, 289, 315, 342, 370, 399, 429, 460, 492, 525, 559, 594, 630, 667, 705, 744, 784, 825, 867, 910, 954, 999, 1045, 1092, 1140, 1189, 1239, 1290, 1342, 1395, 1449, 1504, 1560, 1617, 1675
OFFSET
1,1
COMMENTS
Row 3 of A220032.
LINKS
FORMULA
Empirical: a(n) = (1/2)*n^2 + (13/2)*n - 15 for n>3.
Conjectures from Colin Barker, Jul 30 2018: (Start)
G.f.: x*(4 - 6*x + 4*x^2 + 3*x^3 - 3*x^4 - x^5) / (1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>6.
(End)
EXAMPLE
Some solutions for n=3:
..1..0..0....0..0..0....1..0..0....0..0..0....1..0..0....0..0..0....0..0..0
..1..1..1....1..1..0....1..0..0....1..0..0....1..0..0....0..0..0....0..0..0
..1..1..1....1..1..1....1..1..1....1..0..0....1..0..0....0..0..0....1..1..0
CROSSREFS
Cf. A220032.
Sequence in context: A108900 A076995 A096817 * A277455 A320124 A185913
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 03 2012
STATUS
approved