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.

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

Original entry on oeis.org

5864, 172980, 3708268, 70600212, 1246724695, 21292987433, 357117150362, 5923063781205, 97514964737576, 1597131825489558, 26058934302628094, 423954039651724411, 6881835973423757103, 111509561797692820078
Offset: 1

Views

Author

R. H. Hardin May 17 2012

Keywords

Comments

Row 7 of A212471

Examples

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