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.

A383857 Number of permutations of [n] such that precisely one rising or falling succession occurs, but without either n(n-1) or (n-1)n.

Table of values

n a(n)
1 0
2 0
3 2
4 8
5 34
6 196
7 1366
8 10928
9 98330
10 983036
11 10811134
12 129714184
13 1686103522
14 23603603540
15 354033474374
16 5664286296416
17 96289603698346
18 1733166940314028
19 32929480177913230
20 658578501071986616
21 13829959293448920434
22 304255691156335505924

List of values

[0, 0, 2, 8, 34, 196, 1366, 10928, 98330, 983036, 10811134, 129714184, 1686103522, 23603603540, 354033474374, 5664286296416, 96289603698346, 1733166940314028, 32929480177913230, 658578501071986616, 13829959293448920434, 304255691156335505924]