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.

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

Original entry on oeis.org

353, 4663, 51440, 514687, 4931630, 46305966, 429886243, 3962696059, 36354382954, 332393767866, 3031533285381, 27595759169532, 250826014161861, 2277103688384513, 20652344756363304, 187156724402029627, 1694914205955775462, 15340549508692418292, 138778053213558014181
Offset: 1

Views

Author

R. H. Hardin, May 06 2012

Keywords

Examples

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

Crossrefs

Row 6 of A212232.