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”).

A233490
Number of (n+2) X (1+2) 0..2 arrays with no increasing sequence of length 3 horizontally or antidiagonally downwards.
1
16928, 424009, 10619963, 265993633, 6662227346, 166865923720, 4179418541288, 104680086586273, 2621876804023319, 65669013082159633, 1644783337099349594, 41196176081023328236, 1031822785055468622752, 25843618535508922362697
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 25*a(n-1) + 2*a(n-2) - 21*a(n-3) + 3*a(n-4).
Empirical g.f.: x*(16928 + 809*x - 14118*x^2 + 2028*x^3) / ((1 + x)*(1 - 26*x + 24*x^2 - 3*x^3)). - Colin Barker, Oct 11 2018
EXAMPLE
Some solutions for n=1:
..2..2..2....1..2..2....0..1..1....0..2..0....1..1..0....2..2..2....2..0..1
..1..2..1....2..0..1....2..0..1....1..0..1....2..2..0....1..0..1....1..0..0
..2..0..0....0..1..0....0..2..2....0..0..1....1..2..1....0..0..0....1..2..0
CROSSREFS
Column 1 of A233497.
Sequence in context: A035922 A233497 A233498 * A233489 A205606 A205437
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 11 2013
STATUS
approved