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.

A200518 Least m>0 such that n = y^2-8^x (mod m) has no solution, or 0 if no such m exists.

Table of values

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

List of values

[0, 0, 4, 0, 7, 7, 4, 9, 0, 7, 4, 7, 7, 8, 4, 0, 7, 0, 4, 7, 32, 8, 4, 7, 0, 7, 4, 16, 0, 8, 4, 9, 7, 7, 4, 0, 0, 7, 4, 7, 7, 0, 4, 9, 7, 8, 4, 7, 0, 9, 4, 7, 9, 7, 4, 12, 0, 0, 4, 16, 7, 7, 4, 0, 0, 7, 4, 7, 7, 8, 4, 16, 7, 0, 4, 7, 9, 8, 4, 7, 0, 7, 4, 32]

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

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