|
|
A200665
|
|
Number of 0..5 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 6
|
|
0
|
|
|
6, 21, 75, 267, 938, 3283, 11516, 40399, 141745, 497298, 1744684, 6121152, 21475315, 75342932, 264330011, 927363850, 3253519870, 11414498822, 40046099291, 140495874086, 492909198404, 1729299730308, 6066994825927, 21285162746386
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=6
..0....2....3....0....3....4....1....1....2....0....2....4....0....1....0....1
..3....4....3....0....5....5....5....4....2....3....2....5....1....3....1....2
..3....1....0....0....5....3....2....5....5....5....5....4....5....5....5....3
..1....2....5....0....3....4....5....4....5....4....3....2....1....4....3....3
..2....5....3....0....4....3....4....4....4....5....4....5....2....3....4....3
..5....3....3....4....4....4....5....3....4....4....0....5....2....1....4....3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|