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.

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

Original entry on oeis.org

157, 7803, 191573, 3737885, 67329406, 1167362677, 19808276303, 331605526490, 5501075085468, 90671574326172, 1487390263956378, 24310876230706073, 396224883822318038, 6443121835406288422, 104579933906413425698
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Row 5 of A213464

Examples

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