cp's OEIS Frontend

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

%I A200666 #10 Oct 02 2023 16:22:47
%S A200666 7,28,112,448,1813,7322,29536,119066,479993,1935168,7802161,31456852,
%T A200666 126827111,511338342,2061602939,8311924900,33511832745,135112262286,
%U A200666 544742594039,2196280995578,8854916583356,35701054472646,143938712300001
%N A200666 Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 7.
%H A200666 R. H. Hardin, <a href="/A200666/b200666.txt">Table of n, a(n) for n = 1..210</a>
%e A200666 Some solutions for n=6:
%e A200666 ..1....3....1....4....0....4....4....2....5....4....1....2....1....4....0....2
%e A200666 ..6....4....3....6....4....6....4....5....5....6....1....3....4....6....0....5
%e A200666 ..1....4....4....3....5....3....4....1....5....4....5....6....6....4....3....0
%e A200666 ..6....6....2....6....5....6....6....1....4....0....4....5....4....6....6....4
%e A200666 ..6....6....2....1....6....5....4....4....6....5....6....5....0....5....2....6
%e A200666 ..6....3....5....5....2....1....5....6....6....5....6....5....5....6....5....6
%Y A200666 Column 6 of A200668.
%K A200666 nonn
%O A200666 1,1
%A A200666 _R. H. Hardin_, Nov 20 2011