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.

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

Table of values

n a(n)
0 1
1 8
2 99
3 1602
4 32010
5 761904
6 21064680
7 663848640
8 23500653120
9 923616691200
10 39914540709120
11 1881558401184000
12 96096062174112000
13 5286518167746816000
14 311689569962010240000
15 19608741674518284288000
16 1311187373310480906240000
17 92868537238628772741120000

List of values

[1, 8, 99, 1602, 32010, 761904, 21064680, 663848640, 23500653120, 923616691200, 39914540709120, 1881558401184000, 96096062174112000, 5286518167746816000, 311689569962010240000, 19608741674518284288000, 1311187373310480906240000, 92868537238628772741120000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.