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.

A242060 Lpf_3(A242058(n)-3), where lpf_3(n) = lpf(n/3^t) (cf. A020639) such that 3^t (t>=0) is the maximal power of 3 which divides n.

Table of values

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

List of values

[1, 5, 1, 11, 5, 17, 7, 1, 29, 5, 13, 41, 5, 7, 17, 5, 19, 59, 5, 23, 71, 5, 7, 1, 5, 29, 7, 5, 11, 101, 5, 107, 37, 5, 7, 11, 5, 43, 5, 137, 5, 7, 149, 5, 7, 5, 13, 19, 5, 59, 179, 5, 7, 191, 5, 197, 5, 11, 5, 7, 13, 5, 227, 7, 5, 79, 239, 1, 5, 13, 83, 5, 7]