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.

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

Table of values

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

List of values

[0, 3, 5, 0, 3, 9, 0, 3, 0, 11, 3, 9, 5, 3, 9, 0, 3, 5, 11, 3, 9, 0, 3, 9, 0, 3, 0, 5, 3, 9, 16, 3, 5, 20, 3, 0, 1001, 3, 9, 0, 3, 9, 5, 3, 0, 56, 3, 5, 0, 3, 9, 11, 3, 11, 0, 3, 9, 5, 3, 9, 112, 3, 5, 0, 3, 9, 16, 3, 9, 0, 3, 0, 5, 3, 9, 11, 3, 5, 16, 3, 0, 3367]