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.

A003558 Least number m > 0 such that 2^m == +-1 (mod 2n + 1).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 3
5 5
6 6
7 4
8 4
9 9
10 6
11 11
12 10
13 9
14 14
15 5
16 5
17 12
18 18
19 12
20 10
21 7
22 12
23 23
24 21
25 8
26 26
27 20
28 9
29 29
30 30
31 6
32 6
33 33
34 22
35 35
36 9
37 20
38 30
39 39
40 27
41 41
42 8
43 28
44 11
45 12
46 10
47 36
48 24
49 15
50 50
51 51
52 12
53 53
54 18
55 36
56 14
57 44
58 12
59 24
60 55
61 20
62 50
63 7
64 7
65 65
66 18
67 36
68 34
69 69
70 46

List of values

[1, 1, 2, 3, 3, 5, 6, 4, 4, 9, 6, 11, 10, 9, 14, 5, 5, 12, 18, 12, 10, 7, 12, 23, 21, 8, 26, 20, 9, 29, 30, 6, 6, 33, 22, 35, 9, 20, 30, 39, 27, 41, 8, 28, 11, 12, 10, 36, 24, 15, 50, 51, 12, 53, 18, 36, 14, 44, 12, 24, 55, 20, 50, 7, 7, 65, 18, 36, 34, 69, 46]

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

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