cp's OEIS Frontend

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

%I A200471 #7 Jun 20 2022 09:51:56
%S A200471 29,199,1120,3627,11576,28434,69136,139566,281169,509465,917176,
%T A200471 1519297,2507652,3907871,6070416,8983497,13266213,18901105,26867168,
%U A200471 37023721,50931188,68369984,91636040,120165960,157385059,202502115,260240316
%N A200471 Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its four previous neighbors modulo (n+1).
%C A200471 Row 7 of A200469.
%H A200471 R. H. Hardin, <a href="/A200471/b200471.txt">Table of n, a(n) for n = 1..197</a>
%e A200471 Some solutions for n=6
%e A200471 ..3....0....2....3....0....0....2....0....1....4....1....4....2....5....1....3
%e A200471 ..6....1....5....4....2....3....5....3....6....5....6....6....3....6....2....4
%e A200471 ..4....5....1....1....5....4....3....6....5....6....3....5....5....5....4....0
%e A200471 ..6....6....6....6....6....2....6....6....6....4....3....2....5....6....5....6
%e A200471 ..6....6....5....3....6....6....2....6....6....5....6....3....2....2....5....6
%e A200471 ..1....4....4....0....6....4....2....4....2....6....4....5....6....5....6....2
%e A200471 ..6....0....2....5....3....2....6....1....5....0....2....1....4....5....6....3
%Y A200471 Cf. A200469.
%K A200471 nonn
%O A200471 1,1
%A A200471 _R. H. Hardin_, Nov 18 2011