cp's OEIS Frontend

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.

%I A200665 #6 Jun 02 2025 07:19:22
%S A200665 6,21,75,267,938,3283,11516,40399,141745,497298,1744684,6121152,
%T A200665 21475315,75342932,264330011,927363850,3253519870,11414498822,
%U A200665 40046099291,140495874086,492909198404,1729299730308,6066994825927,21285162746386
%N 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.
%C A200665 Column 5 of A200668
%e A200665 Some solutions for n=6
%e A200665 ..0....2....3....0....3....4....1....1....2....0....2....4....0....1....0....1
%e A200665 ..3....4....3....0....5....5....5....4....2....3....2....5....1....3....1....2
%e A200665 ..3....1....0....0....5....3....2....5....5....5....5....4....5....5....5....3
%e A200665 ..1....2....5....0....3....4....5....4....5....4....3....2....1....4....3....3
%e A200665 ..2....5....3....0....4....3....4....4....4....5....4....5....2....3....4....3
%e A200665 ..5....3....3....4....4....4....5....3....4....4....0....5....2....1....4....3
%K A200665 nonn
%O A200665 1,1
%A A200665 _R. H. Hardin_ Nov 20 2011