The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213466 Number of 0..3 arrays of length 2*n+1 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle) 1

%I

%S 14,310,5542,94238,1568984,25829770,422335348,6874493982,111547175144,

%T 1805837931800,29183975631910,471002809679314,7593394526409992,

%U 122312334606560252,1968761313647420552,31670562474748858142

%N Number of 0..3 arrays of length 2*n+1 with sum less than 3*n in any length 2n subsequence (=less than 50% duty cycle)

%C Row 2 of A213464

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

%e Some solutions for n=3

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

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jun 12 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 17 17:59 EDT 2022. Contains 356189 sequences. (Running on oeis4.)