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

 

Logo


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

%I

%S 7,28,112,448,1792,7140,28434,113193,450812,1795581,7151892,28486092,

%T 113459436,451907189,1799936702,7169108310,28554377148,113731374269,

%U 452989138551,1804244048124,7186257254293,28622677050945,114003380196965

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

%C Column 6 of A200469

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

%e Some solutions for n=6

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

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

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

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

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

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 10:18 EDT 2020. Contains 337337 sequences. (Running on oeis4.)