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!)
A200666 Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 7 1

%I

%S 7,28,112,448,1813,7322,29536,119066,479993,1935168,7802161,31456852,

%T 126827111,511338342,2061602939,8311924900,33511832745,135112262286,

%U 544742594039,2196280995578,8854916583356,35701054472646,143938712300001

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

%C Column 6 of A200668

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

%e Some solutions for n=6

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

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

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

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

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

%e ..6....3....5....5....2....1....5....6....6....5....6....5....5....6....5....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 22:40 EST 2022. Contains 350654 sequences. (Running on oeis4.)