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.

A127821 a(n) = least k such that the remainder of 13^k divided by k is n.

Table of values

n a(n)
1 2
2 11
3 5
4 51
5 44
6 7
7 15
8 371285
9 10
10 74853
11 158
12 13757837
13 17
14 5805311
15 22
16 2181
17 38
18 25
19 30
20 9667
21 74
22 87
23 146
24 23441
25 88
26 19629779
27 35
28 45
29 70
30 235433
31 46
32 55
33 34
34 309
35 134

List of values

[2, 11, 5, 51, 44, 7, 15, 371285, 10, 74853, 158, 13757837, 17, 5805311, 22, 2181, 38, 25, 30, 9667, 74, 87, 146, 23441, 88, 19629779, 35, 45, 70, 235433, 46, 55, 34, 309, 134]