A223411 4X4X4 triangular graph without horizontal edges coloring a rectangular array: number of nX4 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

176, 4664, 139552, 4222748, 128885376, 3940419696, 120598735372, 3692032452520, 113045815121672, 3461502762735476, 105994971183863368, 3245709203698188204, 99388399077982413724, 3043424044848554777500, 93194342137307699884656

Offset

1,1

Comments

Column 4 of A223415

Links

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

Formula

Empirical: a(n) = 52*a(n-1) -605*a(n-2) -4909*a(n-3) +114372*a(n-4) -166245*a(n-5) -5686724*a(n-6) +23200796*a(n-7) +97856804*a(n-8) -637863724*a(n-9) -439926603*a(n-10) +7644806505*a(n-11) -4787204618*a(n-12) -45559087935*a(n-13) +62300374787*a(n-14) +135392995419*a(n-15) -275828351511*a(n-16) -178232690229*a(n-17) +590906665851*a(n-18) +46339826847*a(n-19) -683316723463*a(n-20) +118854244655*a(n-21) +449144213890*a(n-22) -129218066125*a(n-23) -170266844243*a(n-24) +55576426310*a(n-25) +36189598524*a(n-26) -11501894692*a(n-27) -3874207648*a(n-28) +1086490096*a(n-29) +149727936*a(n-30) -36900864*a(n-31)

Example

Some solutions for n=3
..2..4..1..3....7..4..1..0....1..0..2..0....3..1..4..2....2..4..8..4
..4..1..4..1....3..1..4..1....4..1..0..2....1..0..1..4....4..8..5..8
..1..4..2..4....7..3..7..4....8..4..2..5....0..1..4..2....1..4..2..5

Crossrefs

Sequence in context: A243647 A220919 A221635 * A068244 A283200 A283730

Adjacent sequences: A223408 A223409 A223410 * A223412 A223413 A223414

Keyword

nonn

Author

R. H. Hardin Mar 20 2013

Status

approved