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

%I

%S 5,15,45,135,406,1217,3650,10959,32941,99044,297812,895494,2692703,

%T 8096855,24346869,73209872,220138513,661945308,1990435887,5985139586,

%U 17997009753,54116091662,162724331983,489303778636,1471311543936

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

%C Column 4 of A200668

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

%e Some solutions for n=6

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

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

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

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

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

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

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

Last modified November 29 06:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)