(Translated by https://www.hiragana.jp/)
# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a035524 Showing 1-1 of 1 %I A035524 #19 Mar 04 2020 22:57:52 %S A035524 1,2,4,5,10,20,25,50,85,170,340,425,850,1385,3070,6140,10225,15335, %T A035524 29410,65135,129070,317675,1280860,2163725,3999775,7999550,20321515, %U A035524 81946460,138412045,255852575,511705150,1300234475,5242880860 %N A035524 Reverse and add (in base 4). %H A035524 Reinhard Zumkeller, Table of n, a(n) for n = 0..1000 %H A035524 Index entries for sequences related to Reverse and Add! %F A035524 a(n+1) = A055948(a(n)), a(0) = 1. [_Reinhard Zumkeller_, Oct 10 2011] %t A035524 nxt4[n_]:=Module[{idn4=IntegerDigits[n,4]},FromDigits[idn4+ Reverse[idn4], 4]]; NestList[nxt4,1,40] (* _Harvey P. Dale_, May 02 2011 *) %o A035524 (Haskell) %o A035524 a035524 n = a035524_list !! n %o A035524 a035524_list = iterate a055948 1 %o A035524 -- _Reinhard Zumkeller_, Oct 10 2011 %o A035524 (Python) %o A035524 def reversedigits(n, b=10): # reverse digits of n in base b %o A035524 ....x, y = n, 0 %o A035524 ....while x >= b: %o A035524 ........x, r = divmod(x, b) %o A035524 ........y = b*y + r %o A035524 ....return b*y + x %o A035524 A035524_list, l = [1], 1 %o A035524 for _ in range(50): %o A035524 ....l += reversedigits(l,4) %o A035524 ....A035524_list.append(l) %Y A035524 Cf. A035522. %Y A035524 Cf. A030103. %K A035524 nonn,easy,nice,base %O A035524 0,2 %A A035524 _N. J. A. Sloane_ %E A035524 More terms from Larry Reeves (larryr(AT)acm.org), Sep 22 2000 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE