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.
%I A132113 #16 Jan 03 2020 04:54:05 %S A132113 1,8,46,863,4096,86723,487396,8619983,46895986,888761573,4852900117, %T A132113 63900232883,460368102115,296184492863,4092495749632,65079956993723, %U A132113 487949556936025,28845546953093,447426573467032,6526377852149753 %N A132113 Multiply previous term by 8 and reverse. %H A132113 Vaclav Kotesovec, <a href="/A132113/b132113.txt">Table of n, a(n) for n = 1..1000</a> %F A132113 a(n) = reverse(8 * a(n-1)) where a(1) = 1. %F A132113 Conjecture: a(n)^(1/n) tends to 10. - _Vaclav Kotesovec_, Jan 03 2020 %e A132113 a(4) = reverse(8 * a(3)) %e A132113 = reverse(8 * reverse(8 * a(2))) %e A132113 = reverse(8 * reverse(8 * reverse(8 * a(1)))) %e A132113 = reverse(8 * reverse(8 * reverse(8))) %e A132113 = reverse(8 * reverse(8 * 8)) %e A132113 = reverse(8 * 46) %e A132113 = reverse(368) %e A132113 = 863. %p A132113 rev:=proc(n) local nn: nn:=convert(n,base,10): add(nn[j]*10^(nops(nn)-j), j = 1..nops(nn)) end proc: a[1]:=1: for n from 2 to 20 do a[n]:=rev(8*a[n-1]) end do: seq(a[n],n=1..20); # Definition corrected by _Emeric Deutsch_, Nov 07 2007 %t A132113 NestList[IntegerReverse[8#]&,1,20] (* _Harvey P. Dale_, Dec 22 2018 *) %Y A132113 Cf. A036447 (*2), A163632 (*3), A132064 (*4), A045539 (*5), A132078 (*6), A132114 (*7), A133361 (*9). %K A132113 base,nonn %O A132113 1,2 %A A132113 Rachit Agrawal (rachit_agrawal(AT)daiict.ac.in), Oct 31 2007 %E A132113 Definition corrected by _Emeric Deutsch_, Nov 07 2007 %E A132113 Edited by _Jon E. Schoenfield_, May 10 2019