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.

A087094 a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.

Table of values

n a(n)
1 0
2 9
3 0
4 42
5 22
6 78
7 272
8 342
9 506
10 812
11 465
12 111
13 205
14 903
15 2162
16 689
17 3422
18 3660
19 2211
20 2485
21 584
22 1027
23 3403
24 3916
25 9312
26 404
27 3502
28 5671
29 11772
30 12656
31 5334
32 17030
33 1096
34 6394
35 22052
36 11325
37 12246
38 13203
39 27722
40 7439
41 31862
42 32580
43 18145
44 37056
45 19306

List of values

[0, 9, 0, 42, 22, 78, 272, 342, 506, 812, 465, 111, 205, 903, 2162, 689, 3422, 3660, 2211, 2485, 584, 1027, 3403, 3916, 9312, 404, 3502, 5671, 11772, 12656, 5334, 17030, 1096, 6394, 22052, 11325, 12246, 13203, 27722, 7439, 31862, 32580, 18145, 37056, 19306]