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.

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

List of values

[0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 15, 16, 0, 24, 0, 0, 0, 0, 12, 24, 0, 0, 16, 0, 0, 15, 16, 16, 0, 40, 12, 20, 0, 0, 0, 0, 0, 24, 16, 28, 15, 0, 12, 16, 64, 0, 20, 0, 0, 0, 20, 20, 39, 40, 12, 15, 0, 0, 16, 16, 0, 24, 0, 0, 0, 0, 12, 24, 0, 40, 15, 20, 112, 0]

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

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