|
%I #35 Sep 08 2022 08:45:57
%S 0,11,110,1001,1100,1111,10010,10101,11000,11011,11110,100001,100100,
%T 100111,101010,101101,110000,110011,110110,111001,111100,111111,
%U 1000010,1000101,1001000,1001011,1001110,1010001,1010100,1010111,1011010,1011101,1100000
%N Multiples of 3 written in base 2.
%H Nathaniel Johnston, <a href="/A190944/b190944.txt">Table of n, a(n) for n = 0..10000</a>
%H P. Flajolet et al., <a href="https://doi.org/10.1016/0304-3975(92)00065-Y">Mellin Transforms And Asymptotics: Digital Sums</a>, Theoret. Computer Sci. 23 (1994), 291-314.
%H D. J. Newman, <a href="http://dx.doi.org/10.1090/S0002-9939-1969-0244149-8">On the number of binary digits in a multiple of three</a>, Proc. Amer. Math. Soc. 21 (1969) 719-721.
%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F a(n) = A007088(A008585(n)). - _Reinhard Zumkeller_, Sep 01 2013
%F a(A002450(n)) = A002275(2n) = R_{2n}. - _Bernard Schott_, May 04 2021
%p A190944 := proc(n) local b: if(n=0)then return 0: fi: b:=convert(3*n,base,2); return op(convert(b,base,10,10^nops(b))): end: seq(A190944(n),n=0..40); # _Nathaniel Johnston_, May 25 2011
%t FromDigits /@ IntegerDigits[Range[0, 99, 3], 2] (* _Jean-François Alcover_, May 09 2017 *)
%o (Magma) [Seqint(Intseq(n, 2)): n in [0..90 by 3]]; // _Bruno Berselli_, May 25 2011
%o (Haskell)
%o a190944 = a007088 . (* 3) -- _Reinhard Zumkeller_, Sep 01 2013
%o (PARI) a(n) = fromdigits(binary(3*n), 10); \\ _Michel Marcus_, Oct 25 2017
%Y Cf. A002275, A002450, A007088, A008585, A036555.
%K nonn,easy,base
%O 0,2
%A _N. J. A. Sloane_, May 24 2011
%E More terms from _Bruno Berselli_, May 25 2011
|
