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.

A276269 a(n) = n + the largest (if n is even), or the smallest (if n is odd) prime factor of n if n > 1; and a(1)=1.

Table of values

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

List of values

[1, 4, 6, 6, 10, 9, 14, 10, 12, 15, 22, 15, 26, 21, 18, 18, 34, 21, 38, 25, 24, 33, 46, 27, 30, 39, 30, 35, 58, 35, 62, 34, 36, 51, 40, 39, 74, 57, 42, 45, 82, 49, 86, 55, 48, 69, 94, 51, 56, 55, 54, 65, 106, 57, 60, 63, 60, 87, 118, 65, 122, 93, 66, 66, 70, 77, 134]

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

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