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.

A061014 a(n) is the smallest number k such that k! contains k exactly n times.

Table of values

n a(n)
0 0
1 1
2 37
3 313
4 80
5 99
6 586
7 743
8 5972
9 9253
10 8736
11 9789

List of values

[0, 1, 37, 313, 80, 99, 586, 743, 5972, 9253, 8736, 9789]