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.

A339910 After 1, numbers k > 1 such that k has fewer prime divisors than k-1, when they are counted with multiplicity.

Table of values

n a(n)
1 1
2 5
3 7
4 9
5 11
6 13
7 17
8 19
9 21
10 23
11 25
12 29
13 31
14 33
15 37
16 41
17 43
18 46
19 47
20 49
21 51
22 53
23 55
24 57
25 59
26 61
27 65
28 67
29 69
30 71
31 73
32 77
33 79
34 81
35 82
36 83
37 85
38 89
39 91
40 93
41 97
42 101
43 103
44 105
45 106
46 107
47 109
48 111
49 113
50 115
51 118
52 121
53 127
54 129
55 131
56 133
57 137
58 139
59 141
60 145
61 149
62 151
63 153
64 155
65 157
66 161
67 163
68 166
69 167
70 169
71 173
72 177
73 179

List of values

[1, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 29, 31, 33, 37, 41, 43, 46, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 77, 79, 81, 82, 83, 85, 89, 91, 93, 97, 101, 103, 105, 106, 107, 109, 111, 113, 115, 118, 121, 127, 129, 131, 133, 137, 139, 141, 145, 149, 151, 153, 155, 157, 161, 163, 166, 167, 169, 173, 177, 179]