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.

A065083 The least k such that precisely n near-repunit primes can be formed from (10^k-1)/9 by changing one digit from 1 to 0.

Table of values

n a(n)
0 1
1 3
2 8
3 24
4 20
5 12
6 488
7 42
8 162
9 4848
10 642
11 1682

List of values

[1, 3, 8, 24, 20, 12, 488, 42, 162, 4848, 642, 1682]