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.

A071869 Numbers k such that gpf(k) < gpf(k+1) < gpf(k+2) where gpf(k) denotes the largest prime factor of k.

Table of values

n a(n)
1 8
2 9
3 20
4 21
5 24
6 27
7 32
8 45
9 56
10 57
11 77
12 81
13 84
14 90
15 91
16 92
17 105
18 114
19 120
20 125
21 132
22 135
23 140
24 144
25 147
26 165
27 168
28 169
29 170
30 171
31 175
32 176
33 177
34 189
35 200
36 204
37 212
38 216
39 220
40 221
41 225
42 231
43 234
44 235
45 247
46 252
47 260
48 261
49 275
50 288
51 289
52 300
53 315
54 324
55 345
56 354

List of values

[8, 9, 20, 21, 24, 27, 32, 45, 56, 57, 77, 81, 84, 90, 91, 92, 105, 114, 120, 125, 132, 135, 140, 144, 147, 165, 168, 169, 170, 171, 175, 176, 177, 189, 200, 204, 212, 216, 220, 221, 225, 231, 234, 235, 247, 252, 260, 261, 275, 288, 289, 300, 315, 324, 345, 354]

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

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