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.

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

List of values

[0, 0, 3, 5, 9, 3, 0, 9, 3, 0, 0, 3, 35, 5, 3, 11, 9, 3, 5, 0, 3, 16, 9, 3, 11, 9, 3, 20, 5, 3, 16, 9, 3, 5, 9, 3, 0, 11, 3, 0, 9, 3, 20, 5, 3, 32, 11, 3, 5, 9, 3, 0, 9, 3, 28, 37, 3, 11, 5, 3, 200, 9, 3, 5, 0, 3, 16, 9, 3, 16, 9, 3, 35, 5, 3, 0, 9, 3, 5, 9]