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.

A242033 a(n) = lpf(A245024(n)-1), where lpf = least prime factor (A020639).

Table of values

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

List of values

[3, 3, 3, 5, 3, 3, 3, 3, 7, 3, 5, 3, 3, 3, 3, 3, 5, 3, 7, 3, 3, 3, 3, 5, 3, 3, 3, 7, 3, 3, 5, 3, 3, 3, 3, 13, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 3, 11, 3, 7, 3, 5, 3, 3, 3, 3, 3, 5, 3, 7, 3, 3, 3, 11, 3, 5, 3, 3, 3, 7, 3, 3, 5, 3, 19, 3, 3, 3, 3, 5]