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.

A364813 a(n) = Product_{k=2..n} k^ord(n, k) where ord(n, k) = 0 if k does not divide n, otherwise ord(n, k) = e where e is such that k^e divides n but k^(e + 1) does not.

Table of values

n a(n)
1 1
2 2
3 3
4 16
5 5
6 36
7 7
8 256
9 81
10 100
11 11
12 3456
13 13
14 196
15 225
16 32768
17 17
18 17496
19 19
20 16000
21 441
22 484
23 23
24 1327104
25 625
26 676
27 6561
28 43904
29 29
30 810000
31 31
32 2097152
33 1089
34 1156
35 1225
36 362797056
37 37
38 1444
39 1521
40 10240000
41 41
42 3111696
43 43
44 170368
45 273375
46 2116
47 47
48 8153726976
49 2401
50 625000

List of values

[1, 2, 3, 16, 5, 36, 7, 256, 81, 100, 11, 3456, 13, 196, 225, 32768, 17, 17496, 19, 16000, 441, 484, 23, 1327104, 625, 676, 6561, 43904, 29, 810000, 31, 2097152, 1089, 1156, 1225, 362797056, 37, 1444, 1521, 10240000, 41, 3111696, 43, 170368, 273375, 2116, 47, 8153726976, 2401, 625000]