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.

A269304 a(n) = n + n/gpf(n) + 1, where gpf(n) is the greatest prime factor of n or 1 if n = 1.

Table of values

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

List of values

[3, 4, 5, 7, 7, 9, 9, 13, 13, 13, 13, 17, 15, 17, 19, 25, 19, 25, 21, 25, 25, 25, 25, 33, 31, 29, 37, 33, 31, 37, 33, 49, 37, 37, 41, 49, 39, 41, 43, 49, 43, 49, 45, 49, 55, 49, 49, 65, 57, 61, 55, 57, 55, 73, 61, 65, 61, 61, 61, 73, 63, 65, 73, 97, 71, 73, 69]

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

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