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!)
A212472 Number of 0..3 arrays of length 2*n with sum no more than 3*n in any length 2n subsequence (=50% duty cycle) 1

%I

%S 10,150,2338,36814,582440,9240426,146861788,2337014158,37222215640,

%T 593246686360,9460081927746,150915638082466,2408347433725048,

%U 38443582673708348,613802451466325528,9802073528030277518

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

%C Row 1 of A212471

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

%e Some solutions for n=3

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

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ May 17 2012

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 18 13:54 EDT 2021. Contains 347527 sequences. (Running on oeis4.)