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.

A127817 a(n) = least k such that the remainder when 9^k is divided by k is n.

Table of values

n a(n)
1 2
2 7
3 6
4 5
5 38
6 723
7 74
8 2592842671511
9 11
10 3827
11 14
12 717
13 34
14 59035
15 21
16 259
17 152
18 237
19 62
20 626131
21 30
22 169
23 58
24 25
25 56
26 1921
27 39
28 361
29 65
30 49
31 63010
32 287
33 48
34 55
35 46
36 63
37 932
38 3786791
39 69
40 69637
41 230
42 221
43 6707
44 1057
45 57
46 4907
47 253
48 681
49 148
50 393217991
51 70

List of values

[2, 7, 6, 5, 38, 723, 74, 2592842671511, 11, 3827, 14, 717, 34, 59035, 21, 259, 152, 237, 62, 626131, 30, 169, 58, 25, 56, 1921, 39, 361, 65, 49, 63010, 287, 48, 55, 46, 63, 932, 3786791, 69, 69637, 230, 221, 6707, 1057, 57, 4907, 253, 681, 148, 393217991, 70]