This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105153 Consider trajectory of n under repeated application of map k -> A105025(k); a(n) = length of cycle. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 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 DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps]. PROG (C++) #include #include #include using namespace std ; int main(int argc, char *argv[]) { int kmax = 8 ; vector a105025; a105025.push_back(0) ; a105025.push_back(1) ; for(int k=1 ; k < kmax ; k++) { int bstrt = 1 << k ; for(int j=0 ; j < bstrt ; j++) { int s = bstrt ; for(int i= k-1 ; i >=0 ; i--) s += (bstrt+j+k-i) & ( 1< traj ; while ( traj.find(nrep) == traj.end() ) { traj.insert(nrep) ; if ( nrep < a105025.size() ) nrep = a105025[nrep] ; else break ; } cout << traj.size() << ", " ; } cout << endl ; return 0 ; } - R. J. Mathar, Aug 10 2007 (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 CROSSREFS Positions of 1's: A105271. Cf. A102370, A105025, A105027, A105154. Sequence in context: A061498 A106029 A188431 * A000924 A187201 A109909 Adjacent sequences:  A105150 A105151 A105152 * A105154 A105155 A105156 KEYWORD nonn,easy,base AUTHOR Philippe DELEHAM, Apr 30 2005 EXTENSIONS More terms from R. J. Mathar, Aug 10 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .