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.

A206457 Number of 0..n arrays of length n+3 avoiding the consecutive pattern 0..n.

Original entry on oeis.org

5, 216, 4048, 78050, 1679508, 40353460, 1073741632, 31381059366, 999999999700, 34522712143568, 1283918464548432, 51185893014090250, 2177953337809370548, 98526125335693358700, 4722366482869645212928, 239072435685151324846286
Offset: 1

Views

Author

R. H. Hardin, Feb 07 2012

Keywords

Comments

Subdiagonal 3 of A206455.

Crossrefs

Cf. A206455.

Formula

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