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.

A049050 Least p with exactly n distinct factorial numbers == 1 (mod p).

Table of values

n a(n)
1 2
2 5
3 29
4 17
5 23
6 199
7 619
8 3313
9 4093
10 3011
11 355799
12 52163
13 12087071
14 3408707
15 26927543

List of values

[2, 5, 29, 17, 23, 199, 619, 3313, 4093, 3011, 355799, 52163, 12087071, 3408707, 26927543]