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.

A211560 Number of nonnegative integer arrays of length n+6 with new values 0 upwards introduced in order, and containing the value 6.

Original entry on oeis.org

1, 29, 499, 6676, 77078, 810470, 8016373, 76199007, 706750917, 6470051684, 58990507604, 539568082508, 4980617941373, 46623060002853, 444309621663295, 4323539568389616, 43053687075812286, 439371904347001594
Offset: 1

Views

Author

R. H. Hardin Apr 15 2012

Keywords

Comments

Column 7 of A211561

Examples

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

Formula

Empirical: a(n) = sum{j in 7..n+6}stirling2(n+6,j)