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.

A277059 Least k such that any sufficiently long repunit multiplied by k contains all nonzero digits in base n.

Table of values

n a(n)
2 1
3 4
4 6
5 14
6 45
7 370
8 588
9 3364
10 11115
11 168496
12 271458
13 2442138

List of values

[1, 4, 6, 14, 45, 370, 588, 3364, 11115, 168496, 271458, 2442138]