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.

A206459 Number of 0..n arrays of length n+5 avoiding the consecutive pattern 0..n.

Original entry on oeis.org

7, 1791, 64257, 1950000, 60459696, 1977314738, 68719456256, 2541865795524, 99999999950000, 4177248169342446, 184884258894932736, 8650415919381195128, 426878854210636550576, 22168378200531005606250, 1208925819614629174378496
Offset: 1

Views

Author

R. H. Hardin Feb 07 2012

Keywords

Comments

Subdiagonal 5 of A206455

Formula

Empirical: a(n) = sum{i in 0..floor((n+5)/(n+1))} ((-1)^i*(n+1)^((n+5) -(n+1)*i)*binomial((n+5) -n*i,i))