Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #29 Nov 20 2024 08:37:45
%S 11,15,19,21,260,266,268,278,290,294,302,304,308,312,316,318,332,344,
%T 348,380,384,396,410,412,416,420,424,426,434,438,450,460,462,468,500,
%U 502,508,518,520,524,528,532,534,544,550,552,572,574,578,582,586,588,596
%N Digitally balanced numbers in base 3: equal numbers of 0's, 1's, 2's.
%H Alois P. Heinz, <a href="/A049354/b049354.txt">Table of n, a(n) for n = 1..2000</a>
%F A062756(a(n)) = A077267(a(n)) and A081603(a(n)) = A077267(a(n)). - _Reinhard Zumkeller_, Aug 09 2014
%t Select[Range[600],Length[Union[DigitCount[#,3]]]== 1&]
%t FromDigits[#,3]&/@DeleteCases[Flatten[Permutations/@Table[PadRight[{},3n,{1,0,2}],{n,3}],1],_?(#[[1]]==0&)]//Sort (* _Harvey P. Dale_, May 30 2016 *)
%t Select[Range@5000, Differences@DigitCount[#,3]=={0,0}&] (* _Hans Rudolf Widmer_, Dec 11 2021 *)
%o (Haskell)
%o a049354 n = a049354_list !! (n-1)
%o a049354_list = filter f [1..] where
%o f n = t0 == a062756 n && t0 == a081603 n where t0 = a077267 n
%o -- _Reinhard Zumkeller_, Aug 09 2014
%o (Python)
%o from sympy.ntheory import count_digits
%o def ok(n): c = count_digits(n, 3); return c[0] == c[1] == c[2]
%o print([k for k in range(600) if ok(k)]) # _Michael S. Branicky_, Nov 15 2021
%Y Cf. A031443, A031944.
%Y Cf. A049354-A049360. See also A061854, A037861.
%Y Cf. A062756, A077267, A081603.
%Y Row n = 3 of A378000.
%K nonn,base
%O 1,1
%A _Harvey P. Dale_