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.

A186755 Number of permutations of {1,2,...,n} having no increasing cycles. A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) .

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 5
5 23
6 129
7 894
8 7202
9 65085
10 651263
11 7161713
12 85922825
13 1116946192
14 15637356864
15 234562319757
16 3753007054781
17 63801128569995
18 1148420035784849
19 21819978138955622
20 436399552962252082
21 9164390639379582121
22 201616594791853840063

List of values

[1, 0, 0, 1, 5, 23, 129, 894, 7202, 65085, 651263, 7161713, 85922825, 1116946192, 15637356864, 234562319757, 3753007054781, 63801128569995, 1148420035784849, 21819978138955622, 436399552962252082, 9164390639379582121, 201616594791853840063]