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.

A230342 Number of permutations of [2n+2] in which the longest increasing run has length n+2.

Table of values

n a(n)
0 1
1 6
2 67
3 1024
4 19710
5 456720
6 12372360
7 383685120
8 13406178240
9 521194867200
10 22318001798400
11 1043827513344000
12 52949040240096000
13 2895555891900672000
14 169823181579891840000
15 10633812541718446080000
16 708077586604965857280000
17 49962245750984840232960000

List of values

[1, 6, 67, 1024, 19710, 456720, 12372360, 383685120, 13406178240, 521194867200, 22318001798400, 1043827513344000, 52949040240096000, 2895555891900672000, 169823181579891840000, 10633812541718446080000, 708077586604965857280000, 49962245750984840232960000]