[seqfan] Re: A puzzle from Emissary

[Marc LeBrun]

>="NJAS" <njas at research.att.com>
> Me: So consider the sequence
> a(n) = smallest number of steps needed to reach 1

Is the sequence
  a(n) := number of powers of 2 that can be reached from n in just one step
or
  a(n) := number of distinct values that can be reached in just one step
at all interesting?

I haven't been following the constructions closely enough, but given that
n=2^k can go to k+1 different powers of 2 I was wondering about other n.