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

%I

%S 6,21,75,267,938,3283,11516,40399,141745,497298,1744684,6121152,

%T 21475315,75342932,264330011,927363850,3253519870,11414498822,

%U 40046099291,140495874086,492909198404,1729299730308,6066994825927,21285162746386

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

%C Column 5 of A200668

%e Some solutions for n=6

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

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

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

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

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

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

%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 19 06:18 EST 2022. Contains 350464 sequences. (Running on oeis4.)