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.

A004719 Delete all 0's from n.

This page as a plain text file.
%I A004719 #30 Feb 21 2024 01:25:29
%S A004719 1,2,3,4,5,6,7,8,9,1,11,12,13,14,15,16,17,18,19,2,21,22,23,24,25,26,
%T A004719 27,28,29,3,31,32,33,34,35,36,37,38,39,4,41,42,43,44,45,46,47,48,49,5,
%U A004719 51,52,53,54,55,56,57,58,59,6,61,62,63,64,65,66,67,68,69,7,71,72,73,74,75,76,77,78,79,8,81,82,83,84,85,86,87,88,89,9,91,92,93,94,95,96,97,98,99,1,11,12,13,14,15,16,17,18,19,11,111,112,113,114,115,116,117,118,119,12
%N A004719 Delete all 0's from n.
%H A004719 Reinhard Zumkeller, <a href="/A004719/b004719.txt">Table of n, a(n) for n = 1..10000</a>
%F A004719 a(n) = if n <= 9 then n else (if n mod 10 = 0 then a(n/10) else 10*a(floor(n/10)) + n mod 10). [_Reinhard Zumkeller_, Feb 02 2012]
%p A004719 noz:=proc(n) local a,t1,i,j; a:=0; t1:=convert(n,base,10); for i from 1 to nops(t1) do j:=t1[nops(t1)+1-i]; if j <> 0 then a := 10*a+j; fi; od: a; end;
%p A004719 [seq(f(n),n=1..200)]; # _N. J. A. Sloane_, Jun 11 2014
%t A004719 Table[FromDigits[DeleteCases[IntegerDigits[n], 0]], {n, 120}] (* _Alonso del Arte_, Nov 10 2018 *)
%o A004719 (Haskell)
%o A004719 a004719 = read . filter (/= '0') . show :: Integer -> Integer
%o A004719 -- _Reinhard Zumkeller_, Feb 02 2012
%o A004719 (PARI) a(n, base=10) = fromdigits(select(sign, digits(n, base)), base) \\ _Rémy Sigrist_, Nov 10 2018
%o A004719 (Python)
%o A004719 def A004719(n): return int(str(n).replace('0','')) # _Chai Wah Wu_, Feb 20 2024
%Y A004719 Cf. A004151.
%K A004719 base,nonn,look
%O A004719 1,2
%A A004719 _N. J. A. Sloane_