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.

A063433 'Reverse and Add!' trajectory of 10577.

This page as a plain text file.
%I A063433 #21 Apr 25 2025 15:07:33
%S A063433 10577,88078,175166,836737,1574375,7309126,13528163,49710694,99312488,
%T A063433 187733887,976071668,1842242347,9274664828,17559329557,93151725128,
%U A063433 175304440267,937348843838,1775697687577,9533565653348,17967131306707
%N A063433 'Reverse and Add!' trajectory of 10577.
%H A063433 Harry J. Smith, <a href="/A063433/b063433.txt">Table of n, a(n) for n=0,...,200</a>
%H A063433 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%e A063433 a(1) = 10577 + 77501 = 88078.
%t A063433 NestList[#+FromDigits[Reverse[IntegerDigits[#]]]&,10577, 20]  (* _Harvey P. Dale_, Apr 03 2011 *)
%o A063433 (ARIBAS) m := 10577; stop := 20; 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 A063433 (PARI) Rev(x)= { local(d,r); r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); return(r) }
%o A063433 { for (n=0, 200, if (n, a+=Rev(a), a=10577); write("b063433.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 21 2009
%o A063433 (Haskell)
%o A063433 a063433 n = a063433_list !! n
%o A063433 a063433_list = iterate a056964 10577 -- _Reinhard Zumkeller_, Sep 22 2011
%Y A063433 A033865, A023108, A006960, A063434.
%Y A063433 Cf. A056964, A004086.
%K A063433 base,nonn
%O A063433 0,1
%A A063433 _Klaus Brockhaus_, Jul 20 2001