|
| |
|
|
A036044
|
|
BCR(n): write in binary, complement, reverse.
|
|
13
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(0) could be considered to be 0 if the binary representation of zero was chosen to be the empty string. - Jason Kimberley, Sep 19 2011
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..1023
R. K. Hoeflin, Mega Test
|
|
|
FORMULA
| a(2n) = 2*A059894(n), a(2n+1) = a(2n) - 2^[log2(n)+1]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 21 2003
|
|
|
EXAMPLE
| E.g. 4 -> 100 -> 011 -> 110 -> 6.
|
|
|
MATHEMATICA
| dtn[ L_ ] := Fold[ 2#1+#2&, 0, L ]; f[ n_ ] := dtn[ Reverse[ 1-IntegerDigits[ n, 2 ] ] ]; Table[ f[ n ], {n, 0, 100} ]
|
|
|
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
|
|
|
CROSSREFS
| Cf. A035928, A030101, A056539.
Cf. A195063, A195064, A195065, A195066.
Sequence in context: A095832 A143381 A140876 * A078991 A021833 A196072
Adjacent sequences: A036041 A036042 A036043 * A036045 A036046 A036047
|
|
|
KEYWORD
| nonn,easy,base,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
| |
|
|
