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

%I

%S 4,10,26,69,181,455,1120,2794,6955,17254,42770,105825,262026,648672,

%T 1605786,3974375,9835789,24343416,60250311,149117782,369056036,

%U 913396093,2260628044,5594995167,13847440350,34272006253,84822308047,209933077581

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

%C Column 3 of A200469

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

%e Some solutions for n=6

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

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

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

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

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

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

%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 October 20 21:32 EDT 2020. Contains 337910 sequences. (Running on oeis4.)