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.

A086981 a(n) = smallest k where (10^k+1)=0 mod prime(n)^2, or 0 if no such k exists.

Table of values

n a(n)
1 0
2 0
3 0
4 21
5 11
6 39
7 136
8 171
9 253
10 406
11 0
12 0
13 0
14 0
15 1081
16 0
17 1711
18 1830
19 0
20 0
21 292
22 0
23 0
24 1958
25 4656
26 202
27 1751
28 0
29 5886
30 6328
31 2667
32 8515
33 548
34 3197
35 11026
36 0
37 6123
38 0
39 13861
40 0
41 15931
42 16290
43 0
44 18528
45 9653
46 0
47 3165
48 24753
49 0
50 26106
51 27028
52 0
53 3615
54 6275

List of values

[0, 0, 0, 21, 11, 39, 136, 171, 253, 406, 0, 0, 0, 0, 1081, 0, 1711, 1830, 0, 0, 292, 0, 0, 1958, 4656, 202, 1751, 0, 5886, 6328, 2667, 8515, 548, 3197, 11026, 0, 6123, 0, 13861, 0, 15931, 16290, 0, 18528, 9653, 0, 3165, 24753, 0, 26106, 27028, 0, 3615, 6275]