A207097 Number of 0..5 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 6

6, 21, 75, 274, 989, 3579, 12964, 46952, 170076, 616065, 2231527, 8083084, 29278684, 106053662, 384149029, 1391469865, 5040201168, 18256685634, 66129616610, 239535602559, 867649138787, 3142810588438, 11383931537547, 41235032657415

Offset

1,1

Comments

Column 5 of A207100

Links

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

Formula

Empirical: a(n) = 4*a(n-1) -4*a(n-3) -5*a(n-4) +4*a(n-5) +6*a(n-6) -a(n-7) +a(n-8) -6*a(n-9) -4*a(n-10) -6*a(n-11) +9*a(n-12) +2*a(n-13) -3*a(n-14) +2*a(n-15) +5*a(n-16) +7*a(n-17) -6*a(n-18) +a(n-19) -3*a(n-20) +2*a(n-21) +a(n-22) +3*a(n-23) -a(n-24) -4*a(n-25) +a(n-26) -2*a(n-27) +a(n-28) -a(n-29) +a(n-30) -a(n-31) -a(n-32) -a(n-36)

Example

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

Crossrefs

Sequence in context: A200665 A200466 A200249 * A027281 A006814 A108136

Adjacent sequences: A207094 A207095 A207096 * A207098 A207099 A207100

Keyword

nonn

Author

R. H. Hardin Feb 15 2012

Status

approved