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.

A200508 Least m>0 such that n = 8^x-y^2 (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 7
4 0
5 7
6 4
7 0
8 0
9 7
10 4
11 8
12 7
13 20
14 4
15 0
16 7
17 7
18 4
19 7
20 9
21 16
22 4
23 7
24 7
25 16
26 4
27 8
28 0
29 9
30 4
31 7
32 9
33 7
34 4
35 8
36 48
37 7
38 4
39 0
40 7
41 9
42 4
43 8
44 7
45 7
46 4
47 7
48 0
49 20
50 4
51 7
52 7
53 12
54 4
55 0
56 9
57 16
58 4
59 7
60 0
61 7
62 4
63 0
64 0
65 7
66 4
67 8
68 7
69 16
70 4
71 0
72 7
73 7
74 4
75 7
76 32
77 9
78 4
79 7
80 7
81 44
82 4

List of values

[0, 0, 4, 7, 0, 7, 4, 0, 0, 7, 4, 8, 7, 20, 4, 0, 7, 7, 4, 7, 9, 16, 4, 7, 7, 16, 4, 8, 0, 9, 4, 7, 9, 7, 4, 8, 48, 7, 4, 0, 7, 9, 4, 8, 7, 7, 4, 7, 0, 20, 4, 7, 7, 12, 4, 0, 9, 16, 4, 7, 0, 7, 4, 0, 0, 7, 4, 8, 7, 16, 4, 0, 7, 7, 4, 7, 32, 9, 4, 7, 7, 44, 4]

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

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