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.

A066507 Numbers k such that there is a solution to x^2 == 2^k (mod k).

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 7
6 8
7 10
8 12
9 14
10 16
11 17
12 18
13 20
14 22
15 23
16 24
17 26
18 28
19 30
20 31
21 32
22 34
23 36
24 38
25 40
26 41
27 42
28 44
29 46
30 47
31 48
32 49
33 50
34 52
35 54
36 56
37 58
38 60
39 62
40 64
41 66
42 68
43 70
44 71
45 72
46 73
47 74
48 76
49 78
50 79
51 80
52 82
53 84
54 86
55 88
56 89
57 90
58 92
59 94
60 96
61 97
62 98
63 100
64 102
65 103
66 104
67 106
68 108
69 110

List of values

[1, 2, 4, 6, 7, 8, 10, 12, 14, 16, 17, 18, 20, 22, 23, 24, 26, 28, 30, 31, 32, 34, 36, 38, 40, 41, 42, 44, 46, 47, 48, 49, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 71, 72, 73, 74, 76, 78, 79, 80, 82, 84, 86, 88, 89, 90, 92, 94, 96, 97, 98, 100, 102, 103, 104, 106, 108, 110]

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

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