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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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

%I

%S 6,21,75,267,951,3328,11576,40309,140298,487872,1695490,5890943,

%T 20469215,71122969,247110741,858548734,2982886197,10363606865,

%U 36006690099,125099226783,434636165827,1510070809645,5246488474683,18228043608602

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

%C Column 5 of A200469

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

%e Some solutions for n=6

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

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

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

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

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

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

%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 December 5 06:52 EST 2021. Contains 349543 sequences. (Running on oeis4.)