Search: id:A061561 Results 1-1 of 1 results found. %I A061561 %S A061561 22,35,84,105,180,225,360,405,744,837,1488,1581,3024,3213,6048,6237, %T A061561 12192,12573,24384,24765,48960,49725,97920,98685,196224,197757,392448, %U A061561 393981,785664,788733,1571328,1574397,3144192,3150333,6288384,6294525 %N A061561 Trajectory of 22 under the Reverse and Add! operation carried out in base 2. %C A061561 Sequence A058042 written in base 10. 22 is the smallest number whose base 2 trajectory does not contain a palindrome. %H A061561 T. D. Noe, Table of n, a(n) for n=0..500 %H A061561 Klaus Brockhaus, On the 'Reverse and Add!' algorithm in base 2 %H A061561 Index entries for sequences related to Reverse and Add! %F A061561 a(0) = 22; a(1) = 35; for n > 1 and n = 2 (mod 4): a(n) = 6*2^(2*k)-3*2^k where k = (n+6)/4; n = 3 (mod 4): a(n) = 6*2^(2*k)+3*2^k-3 where k = (n+5)/4; n = 0 (mod 4): a(n) = 12*2^(2*k)-3*2^k where k = (n+4)/ 4; n = 1 (mod 4): a(n) = 12*2^(2*k)+9*2^k-3 where k = (n+3)/4. G.f.: -(112*x^9+80*x^8-60*x^7-48*x^6-90*x^5-72*x^4+18*x^2+35*x+22)/((x-1)*(x+1)*(2*x^2-1)*(2*x^4-1)). Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 05 2002 %o A061561 (ARIBAS) m := 22; stop := 36; c := 0; while c < stop do write(m,","); k := bit_length(m); rev := 0; for i := 0 to k-1 do if bit_test(m, i) then rev := bit_set(rev,k-1-i); end; end; inc(c); m := m+rev; end;. %o A061561 (PARI) {m=22; stop=36; c=0; while(c 0,d=divrem(k,2); k=d[1]; rev=2*rev+d[2]); c++; m=m+rev)} %Y A061561 Cf. A058042, A075153. %Y A061561 Sequence in context: A124317 A159518 A100039 this_sequence A167277 A084141 A082261 %Y A061561 Adjacent sequences: A061558 A061559 A061560 this_sequence A061562 A061563 A061564 %K A061561 nonn,base %O A061561 0,1 %A A061561 N. J. A. Sloane (njas(AT)research.att.com), May 18 2001 %E A061561 More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 27 2001 Search completed in 0.001 seconds