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.

A177980 Iterate (n + lpf(n)) / 2 until a prime is reached, where lpf equals the least prime factor. a(n) is that terminating prime.

Table of values

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

List of values

[2, 3, 3, 5, 3, 7, 5, 3, 3, 11, 7, 13, 5, 3, 3, 17, 3, 19, 11, 7, 7, 23, 13, 3, 5, 3, 3, 29, 3, 31, 17, 3, 3, 11, 19, 37, 11, 7, 7, 41, 7, 43, 23, 13, 13, 47, 3, 3, 5, 3, 3, 53, 3, 3, 29, 3, 3, 59, 31, 61, 17, 3, 3, 11, 3, 67, 11, 19, 19, 71, 37, 73, 11]

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

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