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.

A080065 Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).

Table of values

n a(n)
1 3
2 15
3 27
4 39
5 51
6 63
7 75
8 87
9 91
10 99
11 111
12 123
13 135
14 147
15 159
16 171
17 183
18 195
19 203
20 207
21 219
22 231
23 243
24 255
25 259
26 267
27 279
28 291
29 303
30 315
31 327
32 339
33 351
34 363
35 371
36 375
37 387
38 399
39 411
40 423
41 427
42 435
43 447
44 459
45 471
46 483
47 495
48 507
49 519
50 531
51 539
52 543
53 555
54 567

List of values

[3, 15, 27, 39, 51, 63, 75, 87, 91, 99, 111, 123, 135, 147, 159, 171, 183, 195, 203, 207, 219, 231, 243, 255, 259, 267, 279, 291, 303, 315, 327, 339, 351, 363, 371, 375, 387, 399, 411, 423, 427, 435, 447, 459, 471, 483, 495, 507, 519, 531, 539, 543, 555, 567]