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.

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

Original entry on oeis.org

34001, 89911, 242780, 660796, 1804448, 4931630, 13468524, 36711516, 99762134, 269986256, 726810250, 1959270880, 5292416365, 14316932524, 38765529832, 105016326560, 284539410032, 770899685027, 2088100303095, 5654125322731
Offset: 1

Views

Author

R. H. Hardin May 06 2012

Keywords

Comments

Column 5 of A212232

Examples

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