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.

A068535 Numbers k such that 2^k mod k = 2^k mod k^2.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 16
6 32
7 35
8 64
9 128
10 256
11 297
12 512
13 1024
14 1093
15 2048
16 2186
17 2590
18 3279
19 3511
20 4096
21 4372
22 5465
23 6558
24 7022
25 7651
26 8192
27 8744
28 9837
29 10533
30 10930
31 13116
32 14044
33 14209
34 16384
35 21066
36 23175
37 24012
38 24577
39 26592
40 28088
41 31599
42 32768
43 35110
44 38621
45 42132

List of values

[1, 2, 4, 8, 16, 32, 35, 64, 128, 256, 297, 512, 1024, 1093, 2048, 2186, 2590, 3279, 3511, 4096, 4372, 5465, 6558, 7022, 7651, 8192, 8744, 9837, 10533, 10930, 13116, 14044, 14209, 16384, 21066, 23175, 24012, 24577, 26592, 28088, 31599, 32768, 35110, 38621, 42132]