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.

A206458 Number of 0..n arrays of length n+4 avoiding the consecutive pattern 0..n.

Original entry on oeis.org

6, 622, 16128, 390125, 10076832, 282473877, 8589932544, 282429533565, 9999999996000, 379749833577917, 15407021574579456, 665416609183171053, 30491346729331184928, 1477891880035400377125, 75557863725914323402752
Offset: 1

Views

Author

R. H. Hardin Feb 07 2012

Keywords

Comments

Subdiagonal 4 of A206455

Formula

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