|
|
A036044
|
|
BCR(n): write in binary, complement, reverse.
|
|
28
|
|
|
1, 0, 2, 0, 6, 2, 4, 0, 14, 6, 10, 2, 12, 4, 8, 0, 30, 14, 22, 6, 26, 10, 18, 2, 28, 12, 20, 4, 24, 8, 16, 0, 62, 30, 46, 14, 54, 22, 38, 6, 58, 26, 42, 10, 50, 18, 34, 2, 60, 28, 44, 12, 52, 20, 36, 4, 56, 24, 40, 8, 48, 16, 32, 0, 126, 62, 94, 30, 110, 46, 78, 14, 118, 54, 86
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(0) could be considered to be 0 if the binary representation of zero were chosen to be the empty string. - Jason Kimberley, Sep 19 2011
|
|
LINKS
|
T. D. Noe and Indranil Ghosh, Table of n, a(n) for n = 0..10000 (first 1024 terms from T. D. Noe)
|
|
FORMULA
|
a(2n) = 2*A059894(n), a(2n+1) = a(2n) - 2^floor(log_2(n)+1). - Ralf Stephan, Aug 21 2003
|
|
EXAMPLE
|
4 -> 100 -> 011 -> 110 -> 6.
|
|
MAPLE
|
A036044 := proc(n)
local bcr ;
if n = 0 then
return 1;
end if;
convert(n, base, 2) ;
bcr := [seq(1-i, i=%)] ;
add(op(-k, bcr)*2^(k-1), k=1..nops(bcr)) ;
end proc:
seq(A036044(n), n=0..200) ; # R. J. Mathar, Nov 06 2017
|
|
MATHEMATICA
|
dtn[ L_ ] := Fold[ 2#1+#2&, 0, L ]; f[ n_ ] := dtn[ Reverse[ 1-IntegerDigits[ n, 2 ] ] ]; Table[ f[ n ], {n, 0, 100} ]
Table[FromDigits[Reverse[IntegerDigits[n, 2]/.{1->0, 0->1}], 2], {n, 0, 80}] (* Harvey P. Dale, Mar 08 2015 *)
|
|
PROG
|
(Haskell)
import Data.List (unfoldr)
a036044 0 = 1
a036044 n = foldl (\v d -> 2 * v + d) 0 (unfoldr bc n) where
bc 0 = Nothing
bc x = Just (1 - m, x') where (x', m) = divMod x 2
-- Reinhard Zumkeller, Sep 16 2011
(MAGMA) A036044:=func<n|n eq 0 select 1 else SequenceToInteger(Reverse([1-b:b in IntegerToSequence(n, 2)]), 2)>; // Jason Kimberley, Sep 19 2011
(PARI) a(n)=fromdigits(Vecrev(apply(n->1-n, binary(n))), 2) \\ Charles R Greathouse IV, Apr 22 2015
|
|
CROSSREFS
|
Cf. A035928, A030101, A056539, A195063, A195064, A195065, A195066.
Sequence in context: A277681 A140876 A243997 * A335790 A078991 A217572
Adjacent sequences: A036041 A036042 A036043 * A036045 A036046 A036047
|
|
KEYWORD
|
nonn,easy,base,nice,look
|
|
AUTHOR
|
N. J. A. Sloane
|
|
STATUS
|
approved
|
|
|
|