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.

A123700 Smallest m such that A123699(m) = n.

Original entry on oeis.org

1, 2, 3, 4, 10, 25, 37, 61, 64, 173, 100, 1020, 1565, 1595, 2323, 3013, 3771, 11838, 9266, 30407, 56267, 46865, 117612, 143083, 216156, 412555, 413711, 818330, 1846411, 2432526, 2094521, 6909827, 15457515, 12960133, 40274514, 30277528, 53521510, 171018877, 81281761
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 09 2006

Keywords

Comments

In base n representation of a(n) all digits are distinct; this is not the case in all base b representations where b is smaller than n. And for numbers m that are smaller than a(n) exists at least one b such that in base b representation of m all digits are distinct.

Examples

			a(16)=3013 = 101111000101 [b=2] = 11010121 [b=3] = 233011 [b=4] = 44023 [b=5] = 21541 [b=6] = 11533 [b=7] = 5705 [b=8] = 4117 [b=9] = 3013 [b=10] = 229A [b=11] = 18B1 [b=12] = 14AA [b=13] = 1153 [b=14] = D5D [b=15] = BC5 [b=16] distinct digits.
		

Extensions

a(37) and beyond from Michael S. Branicky, Jun 16 2022