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.

A003560 Least number m such that 4^m == +- 1 (mod 4n + 1).

Table of values

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

List of values

[1, 1, 3, 3, 2, 3, 5, 7, 5, 9, 5, 6, 21, 13, 9, 15, 3, 11, 9, 15, 27, 4, 11, 5, 12, 25, 6, 9, 7, 6, 55, 25, 7, 9, 17, 23, 7, 37, 12, 13, 33, 10, 39, 43, 29, 45, 9, 9, 24, 49, 33, 5, 45, 35, 15, 12, 30, 19, 29, 39, 6, 42, 41, 55, 4, 42, 13, 67, 6, 23, 35, 18, 34]

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

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