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.

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

Original entry on oeis.org

793, 65425, 1940673, 43399990, 836356119, 15103463125, 263422708979, 4498700185621, 75773483221458, 1264058518607488, 20939915070874170, 345057032966423355, 5662807472785412683, 92633089841621699568
Offset: 1

Views

Author

R. H. Hardin Jun 12 2012

Keywords

Comments

Row 7 of A213464

Examples

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