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.

A221319 Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo 6.

Original entry on oeis.org

1, 2, 7, 14, 30, 76, 188, 444, 1071, 2638, 6460, 15756, 38783, 95778, 236270, 584394, 1448972, 3596146, 8935547, 22233108, 55380945, 138076092, 344565415, 860595928, 2151093021, 5380523278, 13467284628, 33729132584, 84523860027, 211927633632
Offset: 1

Views

Author

R. H. Hardin Jan 10 2013

Keywords

Comments

Column 6 of A221321

Examples

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