A222099 - 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

A222099

Number of n X 3 0..5 arrays with entries increasing mod 6 by 0, 1, 2 or 3 rightwards and downwards, starting with upper left zero.

16, 530, 17694, 591476, 19776286, 661254950, 22110369320, 739304841874, 24720154977078, 826568484486164, 27637992729347366, 924132309919617038, 30900237030548459544, 1033212061004215656522, 34547539617728922860542

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

OFFSET

1,1

COMMENTS

Column 3 of A222104.

LINKS

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

FORMULA

Empirical: a(n) = 42*a(n-1) - 302*a(n-2) + 521*a(n-3) + 114*a(n-4) - 144*a(n-5).

Empirical g.f.: 2*x*(8 - 71*x + 133*x^2 + 26*x^3 - 36*x^4) / (1 - 42*x + 302*x^2 - 521*x^3 - 114*x^4 + 144*x^5). - Colin Barker, Aug 15 2018

EXAMPLE

Some solutions for n=3: