cp's OEIS Frontend

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

%I A207099 #7 Jun 02 2025 07:40:33
%S A207099 8,36,164,760,3504,16224,75114,347794,1610482,7457403,34531926,
%T A207099 159901992,740434409,3428619670,15876397382,73516462261,340421698733,
%U A207099 1576339895161,7299321618669,33799877958800,156512044508653,724736938606683
%N A207099 Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 8.
%C A207099 Column 7 of A207100
%H A207099 R. H. Hardin, <a href="/A207099/b207099.txt">Table of n, a(n) for n = 1..210</a>
%F A207099 Empirical: a(n) = 4*a(n-1) +6*a(n-2) -9*a(n-3) -27*a(n-4) +49*a(n-6) +41*a(n-7) -15*a(n-8) -74*a(n-9) -21*a(n-10) +24*a(n-11) +14*a(n-12) +10*a(n-13) -108*a(n-14) -72*a(n-15) -91*a(n-16) +24*a(n-17) +77*a(n-18) +126*a(n-19) +102*a(n-20) +90*a(n-21) +192*a(n-22) +188*a(n-23) +162*a(n-24) +165*a(n-25) -12*a(n-26) -24*a(n-27) -446*a(n-28) -378*a(n-29) -335*a(n-30) -191*a(n-31) -101*a(n-32) -111*a(n-33) -83*a(n-34) -31*a(n-35) +165*a(n-36) +208*a(n-37) +237*a(n-38) +191*a(n-39) +24*a(n-40) +29*a(n-41) -12*a(n-42) +11*a(n-43) -22*a(n-44) -5*a(n-45) +20*a(n-46) +6*a(n-47) -23*a(n-48) -35*a(n-49) -31*a(n-50) -26*a(n-51) +2*a(n-52) +2*a(n-53) +3*a(n-54) -a(n-55) +a(n-56) +a(n-57) -a(n-58) +a(n-60) +a(n-61) +a(n-62) +a(n-63)
%e A207099 Some solutions for n=5
%e A207099 ..6....2....4....4....0....6....4....0....0....1....4....1....3....2....1....4
%e A207099 ..7....7....4....5....0....7....5....4....4....6....5....6....6....6....4....4
%e A207099 ..5....1....6....3....1....6....6....6....6....7....2....7....2....5....5....2
%e A207099 ..7....5....2....0....2....5....4....6....7....5....7....5....6....3....3....7
%e A207099 ..5....7....2....5....3....4....3....6....5....4....1....6....7....3....2....4
%K A207099 nonn
%O A207099 1,1
%A A207099 _R. H. Hardin_ Feb 15 2012