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.

A152925 a(n) = smallest number m such that in 1,2,..,m written in base n, no two of the n digits occurs the same number of times.

Table of values

n a(n)
2 1
3 5
4 13
5 47
6 105
7 536
8 1341
9 9231
10 24697
11 212594
12 592269
13 6100559
14 17464969
15 209215572
16 610839805
17 8338210079
18 24709115769
19 378460880126

List of values

[1, 5, 13, 47, 105, 536, 1341, 9231, 24697, 212594, 592269, 6100559, 17464969, 209215572, 610839805, 8338210079, 24709115769, 378460880126]