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.

A015935 Positive integers n such that 2^n == 2^11 (mod n).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 8
6 11
7 14
8 15
9 16
10 31
11 32
12 35
13 51
14 56
15 64
16 121
17 128
18 146
19 224
20 256
21 341
22 451
23 455
24 496
25 508
26 512
27 671
28 781
29 896
30 1024
31 1111
32 1235
33 1271
34 1441
35 1547
36 1661
37 1736
38 1991
39 2048
40 2091
41 2101
42 2321
43 2651
44 2761
45 2981
46 3091
47 3421
48 3584
49 3641
50 3731
51 3751
52 4064
53 4088
54 4403
55 4411
56 4631
57 4741
58 5071
59 5401
60 5731
61 5951
62 6171
63 6191
64 6281
65 6386
66 6611
67 6851
68 6941
69 7051
70 7271
71 7601
72 7711
73 7936
74 8261
75 8371
76 8435
77 8456
78 8921

List of values

[1, 2, 3, 4, 8, 11, 14, 15, 16, 31, 32, 35, 51, 56, 64, 121, 128, 146, 224, 256, 341, 451, 455, 496, 508, 512, 671, 781, 896, 1024, 1111, 1235, 1271, 1441, 1547, 1661, 1736, 1991, 2048, 2091, 2101, 2321, 2651, 2761, 2981, 3091, 3421, 3584, 3641, 3731, 3751, 4064, 4088, 4403, 4411, 4631, 4741, 5071, 5401, 5731, 5951, 6171, 6191, 6281, 6386, 6611, 6851, 6941, 7051, 7271, 7601, 7711, 7936, 8261, 8371, 8435, 8456, 8921]