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.

A282795 Start with n. If n is 1 or a prime, stop. Otherwise, add the prime factors of n (with repetition) to n, and repeat until reaching a prime, when we stop. If no prime is ever reached, a(n) = -1.

Table of values

n a(n)
1 1
2 2
3 3
4 23
5 5
6 11
7 7
8 23
9 23
10 17
11 11
12 19
13 13
14 23
15 23
16 47
17 17
18 41
19 19
20 29
21 31
22 47
23 23
24 47
25 47
26 41
27 71
28 71
29 29
30 71
31 31
32 83
33 47
34 53
35 47
36 71
37 37
38 59
39 71
40 71
41 41
42 83
43 43
44 59
45 167
46 71
47 47
48 59
49 149
50 167
51 71
52 167
53 53
54 83
55 71
56 167
57 79
58 89
59 59
60 251
61 61

List of values

[1, 2, 3, 23, 5, 11, 7, 23, 23, 17, 11, 19, 13, 23, 23, 47, 17, 41, 19, 29, 31, 47, 23, 47, 47, 41, 71, 71, 29, 71, 31, 83, 47, 53, 47, 71, 37, 59, 71, 71, 41, 83, 43, 59, 167, 71, 47, 59, 149, 167, 71, 167, 53, 83, 71, 167, 79, 89, 59, 251, 61]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.