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.

A065429 Number of permutations of {1..n} which contain 3 consecutive terms in increasing order.

Original entry on oeis.org

0, 0, 1, 7, 50, 371, 3023, 26962, 263503, 2806759, 32439638, 404794391, 5429249279, 77941628854, 1193095348531, 19406686847167, 334372746780002, 6085085617645595, 116659595136911903, 2350442395504338154, 49658877772798776295, 1097945956312067172727
Offset: 1

Views

Author

Joe Keane (jgk(AT)jgk.org), Nov 16 2001

Keywords

Examples

			a(3)=1 since 1,2,3 is only solution.
		

Crossrefs

Equals n! - A049774(n).