cp's OEIS Frontend

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

%I A207104 #7 Jun 02 2025 07:41:01
%S A207104 27,239,1193,4322,12964,32531,75114,155922,305362,557095,980755,
%T A207104 1636154,2659934,4162116,6371316,9468167,13851960,19762261,27846149,
%U A207104 38462192,52544085,70608666,94060846,123500085,160955964,207261711,265103651
%N A207104 Number of 0..n arrays x(0..6) of 7 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).
%C A207104 Row 7 of A207100
%H A207104 R. H. Hardin, <a href="/A207104/b207104.txt">Table of n, a(n) for n = 1..210</a>
%e A207104 Some solutions for n=5
%e A207104 ..2....4....2....0....1....0....2....3....0....4....3....1....1....3....0....2
%e A207104 ..3....4....4....0....2....3....2....3....0....5....4....5....3....4....0....5
%e A207104 ..5....2....4....0....4....3....5....4....2....4....3....3....5....1....4....3
%e A207104 ..3....4....3....0....2....2....3....4....2....4....2....3....4....5....4....5
%e A207104 ..4....2....3....2....4....5....4....3....4....4....5....3....3....2....3....3
%e A207104 ..3....1....0....4....3....3....1....3....5....5....2....3....5....5....3....5
%e A207104 ..4....4....4....0....1....4....5....1....5....5....4....2....4....5....1....3
%K A207104 nonn
%O A207104 1,1
%A A207104 _R. H. Hardin_ Feb 15 2012