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.

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

Table of values

n a(n)
1 2
2 23
3 11
4 7
5 10
6 19
7 57
8 17
9 14
10 15
11 614
12 13
13 34

List of values

[2, 23, 11, 7, 10, 19, 57, 17, 14, 15, 614, 13, 34]