A105153 Consider trajectory of n under repeated application of map k -> A105025(k); a(n) = length of cycle.

1, 1, 2, 2, 1, 2, 1, 2, 4, 2, 2, 4, 4, 2, 2, 4, 4, 1, 4, 4, 4, 1, 4, 4, 4, 1, 4, 4, 4, 1, 4, 4, 4, 4, 8, 4, 4, 4, 4, 8, 4, 4, 8, 4, 4, 4, 4, 8, 4, 4, 8, 4, 4, 4, 4, 8, 4, 4, 8, 4, 4, 4, 4, 8, 2, 16, 8, 4, 2, 4, 8, 16, 2, 16, 8, 4, 2, 4, 8, 16, 2, 16, 8, 4, 2, 4, 8, 16, 2, 16, 8, 4, 2, 4, 8, 16, 2, 16, 8, 4, 2

Offset: 0

Author

Philippe Deléham, Apr 30 2005

Keywords

• nonn
• easy
• base

Comments

Why is this always a power of 2?

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
• David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].

Crossrefs

Positions of 1's: A105271.

Cf. A102370, A105025, A105027, A105154.

Programs

Haskell

a105153 n = t [n] where
   t xs@(x:_) | y `elem` xs = length xs
              | otherwise   = t (y : xs) where y = a105025 x
-- Reinhard Zumkeller, Jul 21 2012

Extensions

More terms from R. J. Mathar, Aug 10 2007