OFFSET
0,3
COMMENTS
Why is this always a power of 2?
a(n) is always a power of 2: If n is a k-bit number, then so are all numbers in the A105154-orbit of n. For m in the orbit, the i-th bit (i=1,..,k) of A105154(m) is the i-th bit of m-k+i and hence depends only on the lower i bits of m. By induction quickly follows that the lower i bits run through a cycle of length dividing 2^i. This also shows that a(n) <= n for n > 0.
LINKS
Hagen von Eitzen, Table of n, a(n) for n = 0..10000
PROG
(Haskell)
a105154 n = t [n] where
t xs@(x:_) | y `elem` xs = length xs
| otherwise = t (y : xs) where y = a105027 x
-- Reinhard Zumkeller, Jul 21 2012
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Philippe Deléham, Apr 30 2005
EXTENSIONS
More terms taken from b-file by Hagen von Eitzen, Jun 24 2009
STATUS
approved