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.

A068563 Numbers k such that 2^k == 4^k (mod k).

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 8
6 12
7 16
8 18
9 20
10 24
11 32
12 36
13 40
14 42
15 48
16 54
17 60
18 64
19 72
20 80
21 84
22 96
23 100
24 108
25 120
26 126
27 128
28 136
29 144
30 156
31 160
32 162
33 168
34 180
35 192
36 200
37 216
38 220
39 240
40 252
41 256
42 272
43 288
44 294
45 300
46 312
47 320
48 324
49 336
50 342
51 360
52 378
53 384
54 400
55 408
56 420
57 432
58 440

List of values

[1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 32, 36, 40, 42, 48, 54, 60, 64, 72, 80, 84, 96, 100, 108, 120, 126, 128, 136, 144, 156, 160, 162, 168, 180, 192, 200, 216, 220, 240, 252, 256, 272, 288, 294, 300, 312, 320, 324, 336, 342, 360, 378, 384, 400, 408, 420, 432, 440]