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.

A284050 a(n) = floor(A240751(n) / n), where A240751(n) = the smallest k such that in the prime power factorization of k! there exists at least one exponent n.

Table of values

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

List of values

[2, 3, 1, 1, 2, 2, 1, 1, 2, 1, 1, 4, 2, 2, 1, 1, 2, 1, 1, 4, 2, 1, 1, 4, 1, 1, 2, 2, 6, 2, 1, 1, 4, 1, 1, 2, 4, 1, 1, 2, 1, 1, 4, 2, 2, 1, 1, 2, 1, 1, 4, 4, 1, 1, 2, 1, 1, 2, 2, 6, 2, 2, 1, 1, 4, 1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 2, 4, 1, 1, 2, 1, 1, 4, 2, 1, 1, 4]