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.

A077573 Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0.

Table of values

n a(n)
1 0
2 111
3 0
4 111111
5 11
6 111111
7 1111111111111111
8 111111111111111111
9 1111111111111111111111
10 1111111111111111111111111111
11 111111111111111
12 111
13 11111
14 111111111111111111111
15 1111111111111111111111111111111111111111111111

List of values

[0, 111, 0, 111111, 11, 111111, 1111111111111111, 111111111111111111, 1111111111111111111111, 1111111111111111111111111111, 111111111111111, 111, 11111, 111111111111111111111, 1111111111111111111111111111111111111111111111]