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.

A186758 Number of permutations of {1,2,...,n} with no increasing cycles of length >=2. 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 1
2 1
3 2
4 10
5 59
6 363
7 2491
8 19661
9 176536
10 1767540
11 19460671
12 233578585
13 3036411429
14 42507793209
15 637606959466
16 10201702712738
17 173429224591607
18 3121728583605435
19 59312852905363623
20 1186257030934984061
21 24911396924131631880
22 548050726738352726108

List of values

[1, 1, 1, 2, 10, 59, 363, 2491, 19661, 176536, 1767540, 19460671, 233578585, 3036411429, 42507793209, 637606959466, 10201702712738, 173429224591607, 3121728583605435, 59312852905363623, 1186257030934984061, 24911396924131631880, 548050726738352726108]