cp's OEIS Frontend

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

%I A200671 #7 Jun 02 2025 07:19:55
%S A200671 25,176,1076,3650,11516,29536,70412,145431,291683,534853,956522,
%T A200671 1600651,2633406,4126715,6386960,9505210,14002011,20025031,28396896,
%U A200671 39265235,53923628,72565437,97086596,127619975,166939721,215170884,276186538
%N A200671 Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its three previous neighbors modulo (n+1).
%C A200671 Row 7 of A200668
%H A200671 R. H. Hardin, <a href="/A200671/b200671.txt">Table of n, a(n) for n = 1..210</a>
%e A200671 Some solutions for n=6
%e A200671 ..1....0....0....3....1....0....0....5....0....1....1....2....5....2....5....1
%e A200671 ..6....1....1....4....1....2....1....6....2....6....6....5....5....5....5....6
%e A200671 ..4....3....1....1....5....6....2....5....6....4....5....3....5....2....5....0
%e A200671 ..5....6....2....6....1....6....4....4....6....5....5....3....5....5....5....5
%e A200671 ..5....6....6....4....4....3....2....5....0....4....4....4....4....6....1....4
%e A200671 ..6....2....6....5....4....6....1....6....6....6....5....4....5....6....5....6
%e A200671 ..2....5....1....4....4....4....1....3....6....6....3....5....2....6....6....2
%K A200671 nonn
%O A200671 1,1
%A A200671 _R. H. Hardin_ Nov 20 2011