The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327226 For any n >= 0, let u and v be such that 2 <= u < v and the digits of n in bases u and v are the same up to a permutation and v is minimized; a(n) = v. 2
 3, 3, 4, 5, 6, 7, 8, 5, 10, 7, 12, 9, 14, 10, 16, 13, 13, 7, 20, 16, 22, 17, 4, 10, 26, 21, 11, 25, 5, 13, 13, 9, 34, 29, 15, 16, 31, 16, 11, 37, 37, 19, 19, 13, 19, 13, 6, 21, 50, 11, 22, 7, 7, 16, 25, 17, 25, 17, 13, 28, 62, 55, 28, 19, 57, 29, 7, 15, 7, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Rémy Sigrist, Table of n, a(n) for n = 0..10000 FORMULA A327225(n) < a(n) <= 1 + max(2, n+1). EXAMPLE For n = 11: - the representations of 11 in bases b = 2..9 are:     b  11 in base b     -  ------------     2  "1011"     3  "102"     4  "23"     5  "21"     6  "15"     7  "14"     8  "13"     9  "12" - the representation in base 9 is the least that shows the same digits, up to order, to some former base, namely the base 5, - hence a(11) = 9. PROG (PARI) a(n) = { my (s=[]); for (v=2, oo, my (d=vecsort(digits(n, v))); if (setsearch(s, d), return (v), s=setunion(s, [d]))) } CROSSREFS See A327225 for the corresponding u's. Sequence in context: A120180 A279400 A063197 * A011977 A104803 A104804 Adjacent sequences:  A327223 A327224 A327225 * A327227 A327228 A327229 KEYWORD nonn,base AUTHOR Rémy Sigrist, Aug 27 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 03:06 EDT 2020. Contains 337392 sequences. (Running on oeis4.)