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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 16
5 5
6 1296
7 7
8 512
9 81
10 10000
11 11
12 2985984
13 13
14 38416
15 50625
16 65536
17 17
18 34012224
19 19
20 64000000
21 194481
22 234256
23 23
24 110075314176
25 625
26 456976
27 19683
28 481890304
29 29
30 19683000000000
31 31
32 33554432
33 1185921
34 1336336
35 1500625
36 2821109907456
37 37
38 2085136

List of values

[1, 1, 2, 3, 16, 5, 1296, 7, 512, 81, 10000, 11, 2985984, 13, 38416, 50625, 65536, 17, 34012224, 19, 64000000, 194481, 234256, 23, 110075314176, 625, 456976, 19683, 481890304, 29, 19683000000000, 31, 33554432, 1185921, 1336336, 1500625, 2821109907456, 37, 2085136]