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.

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

List of values

[0, 0, 1, 2, 2, 3, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 2, 2, 3, 5, 3, 2, 3, 4, 3, 4, 3, 4, 8, 3, 1, 2, 3, 2, 3, 6, 2, 2, 3, 1, 3, 4, 3, 2, 3, 2, 3, 3, 3, 4, 6, 7, 3, 4, 4, 4, 5, 4, 5, 4, 4, 5, 1, 2, 5, 2, 3, 5, 4, 2, 3, 6, 3, 4, 6, 7, 7, 2, 3, 2, 3, 4, 8, 3, 3, 4, 7]