Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #36 Jul 27 2024 03:59:12
%S 0,0,0,0,0,0,0,0,0,0,1,0,1,2,3,4,5,6,7,8,2,1,0,1,2,3,4,5,6,7,3,2,1,0,
%T 1,2,3,4,5,6,4,3,2,1,0,1,2,3,4,5,5,4,3,2,1,0,1,2,3,4,6,5,4,3,2,1,0,1,
%U 2,3,7,6,5,4,3,2,1,0,1,2,8,7,6,5,4,3,2,1,0,1,9,8,7,6,5,4,3,2,1,0,10,11,12,13,14,15,16,17,18,19,1
%N Concatenate absolute values of differences between adjacent digits of n.
%C Let the decimal expansion of n be abcd...efg, say. Then a(n) has decimal expansion |a-b| |b-c| |c-d| ... |e-f| |f-g|. Leading zeros in a(n) are omitted.
%C From _M. F. Hasler_, Nov 09 2019: (Start)
%C This sequence coincides with A080465 up to a(109) but is thereafter completely different.
%C Eric Angelini calls a(n) the "ghost" of the number n and considers iterations of n -> n +- a(n) depending on parity of a(n), cf. A329200 and A329201. (End)
%H T. D. Noe, <a href="/A040115/b040115.txt">Table of n, a(n) for n = 0..10000</a>
%H E. Angelini, <a href="http://cinquantesignes.blogspot.com/2019/11/the-ghost-iteration.html">The Ghost Iteration</a>, Personal blog "Cinquante signes", Nov 2019
%F a(n) = 0 iff n is a repdigit >= 11 (A010785). - _Bernard Schott_, May 09 2022
%e a(371) = 46, for example.
%e a(110) = 01 = 1, while A080465(110) = 10 - 1 = 9. - _M. F. Hasler_, Nov 09 2019
%t Table[FromDigits[Abs[Differences[IntegerDigits[n]]]],{n,110}] (* _Harvey P. Dale_, Dec 16 2021 *)
%o (PARI) apply( A040115(n)=fromdigits(abs((n=digits(n+!n))[^-1]-n[^1])), [10..199]) \\ Works for all n >= 0. - _M. F. Hasler_, Nov 09 2019
%Y Cf. A010785, A037904, A040114, A040163, A040997.
%Y Cf. A329200, A329201: iterations of n +- a(n).
%K nonn,base,easy
%O 0,14
%A _Felice Russo_
%E Definition clarified by _N. J. A. Sloane_, Aug 19 2008
%E Name edited by _M. F. Hasler_, Nov 09 2019
%E Terms a(0) = a(1) = ... = a(9) = 0 prepended by _Max Alekseyev_, Jul 26 2024