cp's OEIS Frontend

A200255 Number of 0..n arrays x(0..5) of 6 elements with each no smaller than the sum of its previous elements modulo (n+1).

%I A200255 #7 Jun 02 2025 07:18:06
%S A200255 21,96,476,1215,3387,7168,15724,28125,51895,85536,143052,218491,
%T A200255 337869,491520,721208,1003833,1407681,1900000,2578060,3382071,4457431,
%U A200255 5723136,7375716,9282325,11720787,14521248,18038972,22021875,26948985,32505856
%N A200255 Number of 0..n arrays x(0..5) of 6 elements with each no smaller than the sum of its previous elements modulo (n+1).
%C A200255 Row 6 of A200251
%H A200255 R. H. Hardin, <a href="/A200255/b200255.txt">Table of n, a(n) for n = 1..210</a>
%F A200255 Empirical: a(n) = 2*a(n-1) -2*a(n-3) +2*a(n-4) -2*a(n-5) +2*a(n-7) -2*a(n-9) +2*a(n-11) -2*a(n-12) +2*a(n-13) -2*a(n-15) +3*a(n-16) -4*a(n-17) +4*a(n-19) -4*a(n-20) +4*a(n-21) -4*a(n-23) +4*a(n-25) -4*a(n-27) +4*a(n-28) -4*a(n-29) +4*a(n-31) -3*a(n-32) +2*a(n-33) -2*a(n-35) +2*a(n-36) -2*a(n-37) +2*a(n-39) -2*a(n-41) +2*a(n-43) -2*a(n-44) +2*a(n-45) -2*a(n-47) +a(n-48)
%e A200255 Some solutions for n=6
%e A200255 ..0....5....0....3....2....4....0....0....4....1....3....3....2....1....2....4
%e A200255 ..3....6....2....5....6....6....5....1....5....1....6....4....6....1....3....5
%e A200255 ..5....5....5....1....3....4....5....1....2....5....5....4....3....5....6....2
%e A200255 ..1....2....2....5....4....0....4....3....6....0....3....5....6....4....5....6
%e A200255 ..3....4....5....5....3....3....3....5....5....5....6....5....4....6....2....6
%e A200255 ..5....3....4....6....5....5....3....5....3....6....3....0....4....3....5....3
%K A200255 nonn
%O A200255 1,1
%A A200255 _R. H. Hardin_ Nov 15 2011