cp's OEIS Frontend

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

%I A200468 #7 Jun 02 2025 07:18:41
%S A200468 8,36,164,750,3434,15446,69136,309748,1386973,6207948,27781867,
%T A200468 124317636,556310068,2489502301,11140314293,49852273554,223086037878,
%U A200468 998302588120,4467360525658,19991251154656,89460006607948,400329985806851
%N A200468 Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 8.
%C A200468 Column 7 of A200469
%H A200468 R. H. Hardin, <a href="/A200468/b200468.txt">Table of n, a(n) for n = 1..210</a>
%e A200468 Some solutions for n=6
%e A200468 ..3....3....2....0....3....2....2....3....1....0....4....4....1....4....1....5
%e A200468 ..7....6....6....5....5....2....6....5....4....4....4....4....4....4....1....5
%e A200468 ..4....4....3....6....3....6....4....3....5....6....0....1....5....3....7....7
%e A200468 ..6....6....6....7....6....4....6....5....3....6....3....2....6....5....7....1
%e A200468 ..4....6....3....6....2....7....2....1....7....2....5....4....1....7....7....4
%e A200468 ..7....7....6....7....4....4....3....7....4....5....4....5....2....3....7....5
%K A200468 nonn
%O A200468 1,1
%A A200468 _R. H. Hardin_ Nov 18 2011