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!)
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
10, 150, 2338, 36814, 582440, 9240426, 146861788, 2337014158, 37222215640, 593246686360, 9460081927746, 150915638082466, 2408347433725048, 38443582673708348, 613802451466325528, 9802073528030277518 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Row 1 of A212471
LINKS
EXAMPLE
Some solutions for n=3
..0....1....2....1....3....1....0....0....1....3....3....1....3....2....1....0
..3....3....1....0....3....0....1....3....2....0....1....1....3....0....1....3
..1....2....0....3....1....0....2....0....0....3....1....3....0....0....1....2
..2....2....3....1....0....3....0....3....0....1....1....0....2....1....2....0
..0....0....0....1....0....2....1....1....2....0....3....1....0....3....3....0
..3....0....1....1....2....2....0....2....1....0....0....2....1....3....0....0
CROSSREFS
Sequence in context: A157867 A116156 A224124 * A025750 A365622 A034325
KEYWORD
nonn
AUTHOR
R. H. Hardin May 17 2012
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)