A238992 Number of nX3 0..3 arrays with no element equal to two plus the sum of elements to its left or two plus the sum of the sum of elements above it, modulo 4

15, 203, 2365, 25601, 270671, 2827709, 29422487, 305525459, 3170576253, 32890537051, 341164909807, 3538555502557, 36701472408455, 380656870553721, 3948062617070389, 40947979951532603, 424699049401817205

Offset

1,1

Comments

Column 3 of A238997

Links

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

Formula

Empirical: a(n) = 13*a(n-1) +40*a(n-2) -914*a(n-3) +683*a(n-4) +21799*a(n-5) -40268*a(n-6) -255576*a(n-7) +617879*a(n-8) +1651695*a(n-9) -4744854*a(n-10) -5850014*a(n-11) +20400821*a(n-12) +9443201*a(n-13) -49172224*a(n-14) +1794964*a(n-15) +63874690*a(n-16) -34792348*a(n-17) -46269446*a(n-18) +85331340*a(n-19) +19168016*a(n-20) -137730200*a(n-21) +2475600*a(n-22) +191881992*a(n-23) -35419208*a(n-24) -200659312*a(n-25) +29452144*a(n-26) +50974176*a(n-27) -43973440*a(n-28) +100095104*a(n-29) +81128448*a(n-30) -69032960*a(n-31) -38481920*a(n-32) +7651328*a(n-33) +983040*a(n-34) -524288*a(n-35)

Example

Some solutions for n=4
..0..0..0....0..3..3....3..0..3....1..1..3....0..1..1....3..3..1....1..0..0
..1..1..3....0..3..2....3..0..2....0..1..0....0..0..0....0..3..0....0..1..0
..0..0..0....1..1..2....1..0..2....0..3..3....1..2..0....3..3..2....0..0..3
..1..1..3....1..2..0....0..3..3....1..2..3....1..0..1....1..2..0....1..1..3

Crossrefs

Sequence in context: A207835 A178507 A012566 * A216465 A215903 A373294

Adjacent sequences: A238989 A238990 A238991 * A238993 A238994 A238995

Keyword

nonn

Author

R. H. Hardin, Mar 08 2014

Status

approved