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.

A183902 Number of nondecreasing arrangements of n+3 numbers in 0..7 with each number being the sum mod 8 of three others.

Original entry on oeis.org

5, 22, 243, 1160, 3347, 7416, 14376, 25584, 42852, 68552, 105736, 158272, 230997, 329888, 462252, 636936, 864558, 1157760, 1531484, 2003272, 2593591, 3326184, 4228448, 5331840, 6672312, 8290776, 10233600, 12553136, 15308281
Offset: 1

Views

Author

R. H. Hardin Jan 07 2011

Keywords

Comments

Column 7 of A183904

Examples

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

Formula

Empirical: a(n) = (1/5040)*n^7 + (7/720)*n^6 + (29/144)*n^5 + (329/144)*n^4 + (1259/90)*n^3 + (5167/180)*n^2 - (6955/21)*n + 312 for n>4