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.
%I A284758 #34 Jul 27 2020 11:20:15
%S A284758 1,7,15,24,40,60,144,120,180,336,420,360,900,960,720,840,1260,1440,
%T A284758 2340,1680,2880,3600,8190,2520,9072,9900,6300,6720,20592,5040,10920,
%U A284758 7560,31320,98040,25920,10080,21420,177156,74256,15120,28560,20160
%N A284758 The least positive integer that has exactly n different representations as Brazilian number.
%C A284758 The representation n = 11_(n-1) is not accepted under the definition of a Brazilian number.
%C A284758 The records of this sequence are the highly Brazilian numbers; hence, this sequence is a supersequence of A329383.
%D A284758 D. Lignon, Dictionnaire de (presque) tous les nombres entiers, Ellipses, 2012, page 420.
%H A284758 Giovanni Resta, <a href="/A284758/b284758.txt">Table of n, a(n) for n = 0..100</a>
%e A284758 a(0) = 1 because 1 is the smallest non-Brazilian number.
%e A284758 a(4) = 40 because 40 = 1111_3 = 55_7 = 44_9 = 22_19 and 40 is the smallest integer with four Brazilian representations.
%t A284758 rep[n_] := Length@ Select[Range[2, n/2], 1 == Length@ Union@ IntegerDigits[n, #] &]; a[n_] := Block[{k=1}, While[rep[k] != n, k++]; k]; a /@ Range[0, 15] (* _Giovanni Resta_, Apr 04 2017 *)
%Y A284758 Cf. A066460, A125134, A329383.
%K A284758 nonn,base
%O A284758 0,2
%A A284758 _Bernard Schott_, Apr 04 2017