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

A223409

4 X 4 X 4 triangular graph without horizontal edges coloring a rectangular array: number of n X 2 0..9 arrays where 0..9 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

24, 132, 780, 4664, 28060, 169124, 1020056, 6153860, 37128748, 224020376, 1351668764, 8155585924, 49208586616, 296911448452, 1791484795980, 10809344595640, 65220724455836, 393524597542756, 2374423335359192

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

OFFSET

1,1

COMMENTS

Column 2 of A223415.

LINKS

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

FORMULA

Empirical: a(n) = 9*a(n-1) - 17*a(n-2) - 10*a(n-3) + 26*a(n-4) + 10*a(n-5).

Empirical g.f.: 4*x*(6 - 21*x + 32*x^3 + 10*x^4) / (1 - 9*x + 17*x^2 + 10*x^3 - 26*x^4 - 10*x^5). - Colin Barker, Aug 20 2018

EXAMPLE

Some solutions for n=3: