login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200667 Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 8 1

%I

%S 8,36,164,750,3414,15504,70412,319532,1449895,6578528,29850070,

%T 135443522,614568094,2788573700,12653014693,57412388798,260505742646,

%U 1182031264628,5363405068469,24336170423291,110424101519685,501043586283665

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

%C Column 7 of A200668

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

%e Some solutions for n=6

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Nov 20 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 27 10:39 EST 2022. Contains 350607 sequences. (Running on oeis4.)