OFFSET
0,2
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..10000
P. Flajolet et al., Mellin Transforms And Asymptotics: Digital Sums, Theoret. Computer Sci. 23 (1994), 291-314.
D. J. Newman, On the number of binary digits in a multiple of three, Proc. Amer. Math. Soc. 21 (1969) 719-721.
FORMULA
MAPLE
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
MATHEMATICA
FromDigits /@ IntegerDigits[Range[0, 99, 3], 2] (* Jean-François Alcover, May 09 2017 *)
PROG
(Magma) [Seqint(Intseq(n, 2)): n in [0..90 by 3]]; // Bruno Berselli, May 25 2011
(Haskell)
a190944 = a007088 . (* 3) -- Reinhard Zumkeller, Sep 01 2013
(PARI) a(n) = fromdigits(binary(3*n), 10); \\ Michel Marcus, Oct 25 2017
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
N. J. A. Sloane, May 24 2011
EXTENSIONS
More terms from Bruno Berselli, May 25 2011
STATUS
approved