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.

A206461 Number of 0..n arrays of length n+7 avoiding the consecutive pattern 0..n.

Original entry on oeis.org

9, 14849, 1020000, 48718765, 2176455745, 96888186864, 4398044676096, 205891128374562, 9999999993000000, 505447028486892844, 26623333280864342016, 1461920290375412323014, 83668255425284748853824
Offset: 1

Views

Author

R. H. Hardin Feb 07 2012

Keywords

Comments

Subdiagonal 7 of A206455

Formula

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