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.

A364360 a(n) = dpf(n) ^ tpf(n), where dpf(n) is the number of distinct prime factors of n if n >= 2 and otherwise = 0; tpf(n) is the number of all prime factors of n if n >= 2 and otherwise = 0.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 8, 1, 4, 4, 1, 1, 8, 1, 8, 4, 4, 1, 16, 1, 4, 1, 8, 1, 27, 1, 1, 4, 4, 4, 16, 1, 4, 4, 16, 1, 27, 1, 8, 8, 4, 1, 32, 1, 8, 4, 8, 1, 16, 4, 16, 4, 4, 1, 81, 1, 4, 8, 1, 4, 27, 1, 8, 4, 27, 1, 32, 1, 4, 8, 8, 4, 27, 1, 32, 1]