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.

A182857 Smallest number that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

Table of values

n a(n)
0 1
1 3
2 4
3 6
4 12
5 60
6 2520
7 1286485200
8 35933692027611398678865941374040400000

List of values

[1, 3, 4, 6, 12, 60, 2520, 1286485200, 35933692027611398678865941374040400000]