cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A063051 'Reverse and Add!' trajectory of 879.

This page as a plain text file.
%I A063051 #39 Mar 04 2025 11:09:45
%S A063051 879,1857,9438,17787,96558,182127,903408,1707717,8884788,17759676,
%T A063051 85455447,159910905,668930856,1326970722,3597766953,7194444906,
%U A063051 13288889823,46187778054,91275556218,172541113437,906852258708
%N A063051 'Reverse and Add!' trajectory of 879.
%H A063051 Harry J. Smith and Michael Lee, <a href="/A063051/b063051.txt">Table of n, a(n) for n = 0..2366</a> (Harry J. Smith provided terms 0 through 200)
%H A063051 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e A063051 a(1) = 879 + 978 = 1857.
%t A063051 NestList[# + FromDigits[Reverse[IntegerDigits[#]]]&, 879, 40] (* _Vincenzo Librandi_, Sep 23 2013 *)
%o A063051 (ARIBAS) m := 879; stop := 25; c := 0; rev := int_reverse(m); while m <> rev and c < stop do inc(c); write(m," "); m := m + rev; rev := int_reverse(m); end;
%o A063051 (PARI)
%o A063051 Rev(x)= { local(d); r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); return(r) }
%o A063051 { for (n=0, 200, if (n, a+=Rev(a), a=879); write("b063051.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 16 2009
%o A063051 (Haskell)
%o A063051 a033651 n = a033651_list !! n
%o A063051 a033651_list = iterate a056964 9 -- _Reinhard Zumkeller_, Sep 22 2011
%Y A063051 Cf. A033865, A023108, A006960, A063052, A056964, A004086.
%K A063051 base,nonn
%O A063051 0,1
%A A063051 _Klaus Brockhaus_, Jul 07 2001