1,2

Length of the symmetric signed digit expansion of n with q=2 (i.e. the length of the representation of n in the (-1,0,1)_2 number system).

Table of n, a(n) for n=1..96.

C. Heuberger and H. Prodinger, On minimal expansions in redundant number systems: Algorithms and quantitative analysis, Computing 66(2001), 377-393.

a(n) = A000523(A008585(n)). - Reinhard Zumkeller, Mar 16 2013

Floor[Log[2, 3*Range[100]]] (* Harvey P. Dale, Oct 15 2016 *)

(Haskell)

a085423 = a000523 . a008585 -- Reinhard Zumkeller, Mar 16 2013

Cf. A005578.

Sequence in context: A194847 A262070 A117806 * A260998 A324728 A327008

Adjacent sequences: A085420 A085421 A085422 * A085424 A085425 A085426

nonn,easy

Ralf Stephan, Jun 30 2003

approved