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.

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

List of values

[1, 5, 7, 5, 1, 11, 5, 13, 5, 7, 5, 7, 5, 23, 5, 1, 5, 7, 5, 11, 5, 37, 5, 7, 5, 43, 7, 5, 47, 11, 5, 17, 5, 53, 7, 5, 13, 5, 61, 5, 7, 5, 67, 7, 5, 11, 71, 5, 13, 5, 7, 5, 1, 11, 5, 7, 5, 7, 5, 31, 5, 5, 7, 5, 103, 5, 11, 17, 5, 7, 37, 5, 113, 11, 7, 5, 13, 5]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.