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.

A336650 a(n) = p^e, where p is the smallest odd prime factor of n, and e is its exponent, with a(n) = 1 when n is a power of two.

Table of values

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

List of values

[1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 11, 3, 13, 7, 3, 1, 17, 9, 19, 5, 3, 11, 23, 3, 25, 13, 27, 7, 29, 3, 31, 1, 3, 17, 5, 9, 37, 19, 3, 5, 41, 3, 43, 11, 9, 23, 47, 3, 49, 25, 3, 13, 53, 27, 5, 7, 3, 29, 59, 3, 61, 31, 9, 1, 5, 3, 67, 17, 3, 5, 71, 9, 73, 37, 3, 19, 7, 3, 79, 5, 81, 41, 83, 3, 5, 43, 3, 11, 89, 9, 7, 23, 3]