cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

707, 16649, 321320, 5622580, 95010466, 1578372444, 25966120647, 424537002094, 6911873593516, 112193588288892, 1817051683302947, 29377851622547612, 474335448720482746, 7650319463541214660, 123278749437509026298
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Row 5 of A212471

Examples

			Some solutions for n=3
..2....0....2....2....0....0....0....0....2....0....2....2....0....2....0....0
..0....2....0....2....2....2....0....2....0....0....0....2....0....2....0....2
..0....3....1....3....3....2....3....3....2....2....3....0....1....1....0....2
..3....3....3....2....1....3....1....0....0....2....2....2....2....1....3....0
..1....0....0....0....0....0....2....1....0....2....0....3....2....0....1....0
..0....0....0....0....0....0....0....1....1....1....0....0....3....0....1....1
..0....0....1....0....2....1....0....0....2....0....1....0....0....0....1....1
..0....3....3....2....1....2....3....3....0....0....2....0....1....2....3....3
..0....2....1....2....1....3....1....2....0....0....2....3....1....2....0....3
..1....1....1....3....3....0....3....2....1....0....1....3....1....1....1....0