cp's OEIS Frontend

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

%I A200466 #7 Jun 02 2025 07:18:34
%S A200466 6,21,75,267,951,3328,11576,40309,140298,487872,1695490,5890943,
%T A200466 20469215,71122969,247110741,858548734,2982886197,10363606865,
%U A200466 36006690099,125099226783,434636165827,1510070809645,5246488474683,18228043608602
%N A200466 Number of 0..5 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 6.
%C A200466 Column 5 of A200469
%H A200466 R. H. Hardin, <a href="/A200466/b200466.txt">Table of n, a(n) for n = 1..210</a>
%e A200466 Some solutions for n=6
%e A200466 ..2....1....3....1....0....1....0....1....0....3....0....0....1....0....4....3
%e A200466 ..4....2....5....3....2....1....1....3....4....3....1....2....5....0....4....4
%e A200466 ..4....5....5....5....4....4....1....5....4....2....5....4....0....4....4....5
%e A200466 ..4....4....4....4....1....0....4....3....5....5....1....2....2....4....0....1
%e A200466 ..3....3....5....4....5....1....0....1....2....2....1....4....5....4....0....2
%e A200466 ..4....2....2....5....1....3....2....2....4....0....2....4....1....0....2....0
%K A200466 nonn
%O A200466 1,1
%A A200466 _R. H. Hardin_ Nov 18 2011