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.

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

Original entry on oeis.org

353, 22506, 615561, 12773955, 237475982, 4198162231, 72188618371, 1220298706370, 20395481622380, 338170996357600, 5574396540683306, 91481580201645051, 1496133943774251078, 24401386122053197406, 397092484505964837242, 6450193163022177761972, 104613879499273682174696
Offset: 1

Views

Author

R. H. Hardin, Jun 12 2012

Keywords

Examples

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

Crossrefs

Row 6 of A213464.