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.

A276733 Composite numbers n such that 2^lpf(n) == 2 (mod n), where lpf(n) = A020639(n).

Table of values

n a(n)
1 341
2 1247
3 1387
4 2047
5 2701
6 3277
7 3683
8 4033
9 4369
10 4681
11 5461
12 5963
13 7957
14 8321
15 9017
16 9211
17 10261
18 13747
19 14351
20 14491
21 15709
22 17593
23 18721
24 19951
25 20191
26 23377
27 24929
28 25351
29 29041
30 31417
31 31609
32 31621
33 33227
34 35333
35 37901
36 42799
37 45761
38 46513
39 49141
40 49601
41 49981

List of values

[341, 1247, 1387, 2047, 2701, 3277, 3683, 4033, 4369, 4681, 5461, 5963, 7957, 8321, 9017, 9211, 10261, 13747, 14351, 14491, 15709, 17593, 18721, 19951, 20191, 23377, 24929, 25351, 29041, 31417, 31609, 31621, 33227, 35333, 37901, 42799, 45761, 46513, 49141, 49601, 49981]

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

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