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.

A377774 a(n) = largest prime p < gpf(n) that does not divide n, or p = nextprime(gpf(n)) for n in A055932, where gpf = A006530.

Table of values

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

List of values

[2, 3, 2, 3, 3, 5, 5, 3, 2, 3, 7, 5, 11, 5, 2, 3, 13, 5, 17, 3, 5, 7, 19, 5, 3, 11, 2, 5, 23, 7, 29, 3, 7, 13, 3, 5, 31, 17, 11, 3, 37, 5, 41, 7, 2, 19, 43, 5, 5, 3, 13, 11, 47, 5, 7, 5, 17, 23, 53, 7, 59, 29, 5, 3, 11, 7, 61, 13, 19, 3, 67, 5, 71, 31, 2, 17, 5]