The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 1

%I

%S 8,36,164,750,3434,15446,69136,309748,1386973,6207948,27781867,

%T 124317636,556310068,2489502301,11140314293,49852273554,223086037878,

%U 998302588120,4467360525658,19991251154656,89460006607948,400329985806851

%N 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 Column 7 of A200469

%H R. H. Hardin, <a href="/A200468/b200468.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=6

%e ..3....3....2....0....3....2....2....3....1....0....4....4....1....4....1....5

%e ..7....6....6....5....5....2....6....5....4....4....4....4....4....4....1....5

%e ..4....4....3....6....3....6....4....3....5....6....0....1....5....3....7....7

%e ..6....6....6....7....6....4....6....5....3....6....3....2....6....5....7....1

%e ..4....6....3....6....2....7....2....1....7....2....5....4....1....7....7....4

%e ..7....7....6....7....4....4....3....7....4....5....4....5....2....3....7....5

%K nonn

%O 1,1

%A _R. H. Hardin_ Nov 18 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 13:41 EST 2021. Contains 349412 sequences. (Running on oeis4.)