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.

A098383 Define a function f on the positive integers by: if n is 1 or composite, stop; but if n = prime(k) then f(n) = k; a(n) = sum of terms in trajectory of n under repeated application of f.

Table of values

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

List of values

[1, 3, 6, 4, 11, 6, 11, 8, 9, 10, 22, 12, 19, 14, 15, 16, 28, 18, 27, 20, 21, 22, 32, 24, 25, 26, 27, 28, 39, 30, 53, 32, 33, 34, 35, 36, 49, 38, 39, 40, 60, 42, 57, 44, 45, 46, 62, 48, 49, 50, 51, 52, 69, 54, 55, 56, 57, 58, 87, 60, 79, 62, 63, 64, 65, 66, 94, 68, 69, 70, 91, 72]