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.

A161986 a(n) = k+r where k is composite(n) and r is (largest prime divisor of k) mod (smallest prime divisor of k).

Table of values

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

List of values

[4, 7, 8, 9, 11, 13, 15, 17, 16, 19, 21, 22, 23, 25, 25, 27, 27, 29, 31, 32, 35, 35, 37, 37, 39, 40, 41, 43, 45, 47, 47, 49, 49, 51, 53, 53, 55, 56, 57, 58, 59, 61, 63, 64, 64, 68, 67, 69, 71, 71, 73, 75, 77, 77, 81, 79, 81, 81, 83, 85, 87, 87, 89, 89, 91, 97, 93, 94, 95, 99, 97]

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

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