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.

A200522 Least m>0 such that n = 2^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 0
3 0
4 0
5 15
6 12
7 0
8 0
9 20
10 16
11 24
12 0
13 32
14 20
15 0
16 0
17 28
18 12
19 56
20 15
21 16
22 16
23 0
24 112
25 68
26 16
27 40
28 0
29 20
30 12
31 0
32 0
33 52
34 20
35 15
36 80
37 16
38 16
39 0
40 112
41 36
42 12
43 56
44 33
45 28
46 28
47 0
48 0
49 20
50 15
51 40
52 128
53 16
54 12
55 0
56 117
57 48
58 16
59 24
60 0
61 44
62 28
63 0
64 0
65 15
66 12
67 40
68 63

List of values

[0, 0, 0, 0, 0, 15, 12, 0, 0, 20, 16, 24, 0, 32, 20, 0, 0, 28, 12, 56, 15, 16, 16, 0, 112, 68, 16, 40, 0, 20, 12, 0, 0, 52, 20, 15, 80, 16, 16, 0, 112, 36, 12, 56, 33, 28, 28, 0, 0, 20, 15, 40, 128, 16, 12, 0, 117, 48, 16, 24, 0, 44, 28, 0, 0, 15, 12, 40, 63]

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

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