A085423 a(n) = floor(log_2(3n)).

1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

Offset: 1

Author

Ralf Stephan, Jun 30 2003

Keywords

• nonn
• easy

Comments

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).

n occurs A001045(n) times. - Amiram Eldar, Feb 18 2024

Links

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

Crossrefs

Cf. A005578, A001045.

Cf. A000523, A008585, A002162.

Programs

Haskell

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

Mathematica

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

Formula

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

Sum_{n>=1} (-1)^(n+1)/a(n) = log(2) (A002162). - Amiram Eldar, Feb 18 2024