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.

A244782 Number of length n 0..2 arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.

Original entry on oeis.org

1, 3, 7, 17, 41, 123, 345, 953, 2613, 7149, 19541, 53397, 145893, 437679, 1273955, 3675989, 10551223, 30194773, 86246645, 246068131, 701551365, 1999277391, 5695980955, 17087942865, 50401117439, 147878352761, 432425644451
Offset: 1

Views

Author

R. H. Hardin, Jul 06 2014

Keywords

Comments

Column 2 of A244788

Examples

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