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.

A339378 Let n be a positive integer. For each prime divisor p of n, consider the highest power of p which does not exceed n. The sum a(n) of these powers is defined as the power-sum of n.

Table of values

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

List of values

[0, 2, 3, 4, 5, 7, 7, 8, 9, 13, 11, 17, 13, 15, 14, 16, 17, 25, 19, 21, 16, 27, 23, 25, 25, 29, 27, 23, 29, 68, 31, 32, 38, 49, 32, 59, 37, 51, 40, 57, 41, 66, 43, 43, 52, 55, 47, 59, 49, 57, 44, 45, 53, 59, 36, 81, 46, 61, 59, 84, 61, 63, 76, 64, 38, 102, 67, 81]