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.

A200466 Number of 0..5 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 6.

Original entry on oeis.org

6, 21, 75, 267, 951, 3328, 11576, 40309, 140298, 487872, 1695490, 5890943, 20469215, 71122969, 247110741, 858548734, 2982886197, 10363606865, 36006690099, 125099226783, 434636165827, 1510070809645, 5246488474683, 18228043608602
Offset: 1

Views

Author

R. H. Hardin Nov 18 2011

Keywords

Comments

Column 5 of A200469

Examples

			Some solutions for n=6
..2....1....3....1....0....1....0....1....0....3....0....0....1....0....4....3
..4....2....5....3....2....1....1....3....4....3....1....2....5....0....4....4
..4....5....5....5....4....4....1....5....4....2....5....4....0....4....4....5
..4....4....4....4....1....0....4....3....5....5....1....2....2....4....0....1
..3....3....5....4....5....1....0....1....2....2....1....4....5....4....0....2
..4....2....2....5....1....3....2....2....4....0....2....4....1....0....2....0