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

%I

%S 2,3,5,8,13,20,29,43,63,91,130,184,262,370,519,724,1010,1408,1955,

%T 2705,3735,5157,7107,9775,13418,18406,25227,34529,47200,64455,87969,

%U 119952,163415,222427,302568,411334,558808,758640,1029312,1395882,1891970

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

%C Column 1 of A200469

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

%e Some solutions for n=6

%e ..0....1....0....0....0....0....1....1....0....0....0....0....0....1....1....1

%e ..0....1....1....0....0....0....1....1....1....0....1....0....1....1....1....1

%e ..1....1....1....0....0....0....0....1....1....0....1....1....1....1....0....0

%e ..1....1....0....1....0....0....0....1....0....1....1....1....0....1....0....0

%e ..0....1....0....1....1....0....1....1....1....1....1....0....0....0....0....1

%e ..0....1....0....0....1....0....1....0....1....1....0....1....1....1....1....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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 11:47 EDT 2021. Contains 347472 sequences. (Running on oeis4.)