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.

A120454 a(n) = ceiling(GPF(n)/LPF(n)) where GPF is greatest prime factor, LPF is least prime factor.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 4, 2, 1, 1, 2, 1, 3, 3, 6, 1, 2, 1, 7, 1, 4, 1, 3, 1, 1, 4, 9, 2, 2, 1, 10, 5, 3, 1, 4, 1, 6, 2, 12, 1, 2, 1, 3, 6, 7, 1, 2, 3, 4, 7, 15, 1, 3, 1, 16, 3, 1, 3, 6, 1, 9, 8, 4, 1, 2, 1, 19, 2, 10, 2, 7, 1, 3, 1, 21, 1, 4, 4, 22, 10, 6, 1, 3, 2, 12, 11, 24, 4, 2, 1, 4, 4]