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.

A212466 Number of 0..3 arrays of length n+5 with sum no more than 9 in any length 6 subsequence (=50% duty cycle).

Original entry on oeis.org

2338, 7862, 27024, 93308, 321320, 1098260, 3708268, 12564894, 42730092, 145559900, 495992448, 1689131389, 5747566618, 19552052026, 66524165343, 226393294930, 770536024747, 2622515229619, 8925194014628, 30373724176979
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Column 3 of A212471

Examples

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