A266029 - OEIS

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

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

Other ways to Give

A266029

Number of nX4 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than itself.

11, 315, 5594, 118489, 2482216, 52086421, 1092258910, 22909266015, 480473869537, 10077157027608, 211350503493933, 4432712286529026, 92968428515505883, 1949851492689803393, 40894749305093748839, 857696374917901826350

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 4 of A266033.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 11*a(n-1) +231*a(n-2) -100*a(n-3) -7612*a(n-4) -1116*a(n-5) +74582*a(n-6) -64354*a(n-7) -370540*a(n-8) +661109*a(n-9) +1260417*a(n-10) +252581*a(n-11) -15283*a(n-12) +86793*a(n-13) -32631*a(n-14) +2989*a(n-15) -36*a(n-16) for n>17

EXAMPLE

Some solutions for n=4

..0..2..2..0....0..0..0..2....0..0..2..0....0..2..3..1....0..0..0..2

..1..0..0..1....2..0..0..1....1..2..4..0....1..0..0..1....2..1..1..1

..0..0..1..2....2..1..4..0....0..3..0..0....0..0..4..1....2..0..0..2

..0..3..1..0....2..0..3..0....0..2..3..0....0..0..0..0....1..3..0..0

CROSSREFS

Cf. A266033.

Sequence in context: A267753 A233241 A266830 * A106827 A276977 A176285

Adjacent sequences: A266026 A266027 A266028 * A266030 A266031 A266032

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 20 2015

STATUS

approved