cp's OEIS Frontend

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.

%I A152925 #18 Oct 29 2023 17:28:12
%S A152925 1,5,13,47,105,536,1341,9231,24697,212594,592269,6100559,17464969,
%T A152925 209215572,610839805,8338210079,24709115769,378460880126
%N 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.
%e A152925 In base 5 in 1,2,..,142_5 = 47, digit 1 occurs 43 times, 2 occurs 20, 3 occurs 19 times, 4 occurs 17 times, and 0 occurs 14.
%o A152925 (Python)
%o A152925 def different(d):
%o A152925     for i in range(len(d)):
%o A152925         for j in range(i):
%o A152925             if d[i] == d[j]:
%o A152925                 return False
%o A152925     return True
%o A152925 def a(base):
%o A152925     d = [0] * base
%o A152925     n = 0
%o A152925     while True:
%o A152925         n += 1
%o A152925         m = n
%o A152925         while m > 0:
%o A152925             d[m % base] += 1
%o A152925             m //= base
%o A152925         if different(d):
%o A152925             break
%o A152925     return n
%K A152925 nonn,base,more
%O A152925 2,2
%A A152925 _Jan Fricke_, Dec 15 2008
%E A152925 Edited by _Franklin T. Adams-Watters_, Sep 11 2011
%E A152925 a(16)-a(19) from _Michael S. Branicky_, Mar 26 2022