|
%I #40 Jul 24 2022 02:04:38
%S 0,1,2,3,4,5,6,7,8,9,10,1,12,13,14,15,16,17,18,19,20,21,2,23,24,25,26,
%T 27,28,29,30,31,32,3,34,35,36,37,38,39,40,41,42,43,4,45,46,47,48,49,
%U 50,51,52,53,54,5,56,57,58,59,60,61,62,63,64,65,6,67,68,69,70,71,72,73,74
%N a(n) is the number formed by removing from n each digit if it is a duplicate of the previous digit, from left to right.
%C Please see discussion in A337857.
%C Similar to A137564 from which first differs at a(101) = 101 here, there a(101) = 10.
%C Differs from A106612 starting at n=100. - _R. J. Mathar_, Oct 08 2020
%H Michael S. Branicky, <a href="/A337864/b337864.txt">Table of n, a(n) for n = 0..10000</a>
%e a(100) = 10. Note that the second zero from the index n = 100 has been removed.
%e a(101) = 101.
%e a(1211323171) = 121323171. Note that the third "1" from the index n has been removed).
%o (Perl) sub a {my($n)=@_; $n =~ s/(.)\1+/$1/g; $n} # _Kevin Ryde_, Oct 04 2020
%o (Python)
%o from itertools import groupby
%o def a(n): return int("".join(k for k, g in groupby(str(n))))
%o print([a(n) for n in range(75)]) # _Michael S. Branicky_, Jul 23 2022
%o (PARI) a(n) = if(n < 10, return(n)); if(n%10 == (n\10)%10, return(a(n\10)), return(a(n\10)*10+n%10)) \\ _David A. Corneth_, Jul 23 2022
%Y Cf. A043096 (fixed points a(n)=n).
%Y Cf. A137564, A337857.
%Y Cf. A090079 (in binary).
%K base,nonn
%O 0,3
%A _Rodolfo Kurchan_, Sep 27 2020
|
