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.

A006530 Gpf(n): greatest prime dividing n, for n >= 2; a(1)=1.

Table of values

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

List of values

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