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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 6
5 41
6 293
7 2309
8 19975
9 189524
10 1960041
11 21993884
12 266361634
13 3465832370
14 48245601976
15 715756932697
16 11277786883720
17 188135296651083
18 3313338641692957
19 61444453534759589
20 1196988740015236617
21 24442368179977776766
22 522124104504306695929

List of values

[0, 0, 1, 6, 41, 293, 2309, 19975, 189524, 1960041, 21993884, 266361634, 3465832370, 48245601976, 715756932697, 11277786883720, 188135296651083, 3313338641692957, 61444453534759589, 1196988740015236617, 24442368179977776766, 522124104504306695929]

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

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