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.

A339141 a(n) = reverse(10*n - a(n-1)), with n>1, a(1) = 1.

This page as a plain text file.
%I A339141 #30 Jan 06 2021 16:00:53
%S A339141 1,91,-16,65,-51,111,-14,49,14,68,24,69,16,421,-172,233,-36,612,-224,
%T A339141 424,-412,236,-6,642,-293,355,-58,833,-345,546,-632,259,17,323,72,882,
%U A339141 -215,595,-502,209,102,813,-383,328,221,932,-264,447,34,664,-451
%N A339141 a(n) = reverse(10*n - a(n-1)), with n>1, a(1) = 1.
%C A339141 Note that for x<0, reverse(x) is defined by -1*reverse(-x).
%C A339141 Starting the sequence with other numbers also gives similar-looking graphs.
%H A339141 Clément Vovard, <a href="/A339141/b339141.txt">Table of n, a(n) for n = 1..10000</a>
%F A339141 a(n) = reverse(10*n - a(n-1)) where reverse means reverse the order of the digits.
%e A339141 For n = 2, 10*n = 10*2 = 20, 20 - a(n-1) = 20 - 1 = 19, reverse(19) = 91.
%e A339141 For n = 3, 10*n = 10*3 = 30, 30 - a(3-1) = 30 - 91 = -61, reverse(-61) = -16.
%p A339141 a:= proc(n) option remember; `if`(n<2, n, (p-> signum(p)* (f->
%p A339141       parse(cat(f[-i]$i=1..length(f))))(""||(abs(p))))(10*n-a(n-1)))
%p A339141     end:
%p A339141 seq(a(n), n=1..60);  # _Alois P. Heinz_, Jan 06 2021
%t A339141 nmax=51; a[1]=1; a[n_]:=Sign[10n-a[n-1]]IntegerReverse[10n-a[n-1]]; Table[a[n],{n,nmax}] (* _Stefano Spezia_, Dec 05 2020 *)
%o A339141 (PARI) rev(n) = sign(n)*fromdigits(Vecrev(digits(n)));
%o A339141 a(n) = if (n==1, 1, rev(10*n-a(n-1))); \\ _Michel Marcus_, Dec 05 2020
%Y A339141 Cf. A004086, A166525.
%K A339141 sign,look,base
%O A339141 1,2
%A A339141 _Clément Vovard_, Nov 25 2020