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.

A039960 For n >= 2, a(n) = largest value of k such that n^k is <= n! (a(0) = a(1) = 1 by convention).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 3
7 4
8 5
9 5
10 6
11 7
12 8
13 8
14 9
15 10
16 11
17 11
18 12
19 13
20 14
21 14
22 15
23 16
24 17
25 18
26 18
27 19
28 20
29 21
30 21
31 22
32 23
33 24
34 25
35 25
36 26
37 27
38 28
39 29
40 29
41 30
42 31
43 32
44 33
45 33
46 34
47 35
48 36
49 37
50 37
51 38
52 39
53 40
54 41
55 42
56 42
57 43
58 44
59 45
60 46
61 46
62 47
63 48
64 49
65 50
66 50
67 51
68 52
69 53
70 54
71 55
72 55
73 56
74 57

List of values

[1, 1, 1, 1, 2, 2, 3, 4, 5, 5, 6, 7, 8, 8, 9, 10, 11, 11, 12, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 25, 25, 26, 27, 28, 29, 29, 30, 31, 32, 33, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 42, 43, 44, 45, 46, 46, 47, 48, 49, 50, 50, 51, 52, 53, 54, 55, 55, 56, 57]