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.

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

Original entry on oeis.org

6, 106, 1758, 28722, 466136, 7536790, 121573668, 1957953138, 31497261096, 506264941416, 8132104116670, 130559338628190, 2095252193645448, 33614011364219588, 539119053140521448, 8644670545679274098
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Row 1 of A213464

Examples

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