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.

A212470 Number of 0..3 arrays of length n+13 with sum no more than 21 in any length 14 subsequence (=50% duty cycle).

Original entry on oeis.org

146861788, 523487828, 1908601444, 7023308036, 25966120647, 96239314549, 357117150362, 1325550644016, 4918335298665, 18232047941771, 67489103954016, 249349516426188, 919083218908202, 3377977784235134, 12373106402582424
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Column 7 of A212471

Examples

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