cp's OEIS Frontend

A051801 Product of the nonzero digits of n.

%I A051801 #62 Nov 04 2024 18:31:32
%S A051801 1,1,2,3,4,5,6,7,8,9,1,1,2,3,4,5,6,7,8,9,2,2,4,6,8,10,12,14,16,18,3,3,
%T A051801 6,9,12,15,18,21,24,27,4,4,8,12,16,20,24,28,32,36,5,5,10,15,20,25,30,
%U A051801 35,40,45,6,6,12,18,24,30,36,42,48,54,7,7,14,21
%N A051801 Product of the nonzero digits of n.
%H A051801 Zak Seidov and Michael De Vlieger, <a href="/A051801/b051801.txt">Table of n, a(n) for n = 0..10000</a> (First 1000 terms from Zak Seidov)
%H A051801 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%F A051801 a(n) = 1 if n=0, otherwise a(floor(n/10)) * (n mod 10 + 0^(n mod 10)). - _Reinhard Zumkeller_, Oct 13 2009
%F A051801 G.f. A(x) satisfies: A(x) = (1 + x + 2*x^2 + 3*x^3 + 4*x^4 + 5*x^5 + 6*x^6 + 7*x^7 + 8*x^8 + 9*x^9) * A(x^10). - _Ilya Gutkovskiy_, Nov 14 2020
%F A051801 a(n) = A007954(A004719(n)). - _Michel Marcus_, Mar 07 2022
%e A051801 a(0) = 1 since an empty product is 1 by convention. a(120) = 1*2 = 2.
%p A051801 A051801 := proc(n) local d,j: d:=convert(n,base,10): return mul(`if`(d[j]=0,1,d[j]), j=1..nops(d)): end: seq(A051801(n),n=0..100); # _Nathaniel Johnston_, May 04 2011
%t A051801 (Times@@Cases[IntegerDigits[#],Except[0]])&/@Range[0,80] (* _Harvey P. Dale_, Jun 20 2011 *)
%t A051801 Table[Times@@(IntegerDigits[n]/.(0->1)),{n,0,80}] (* _Harvey P. Dale_, Apr 16 2023 *)
%o A051801 (Haskell)
%o A051801 a051801 0 = 1
%o A051801 a051801 n = (a051801 n') * (m + 0 ^ m) where (n',m) = divMod n 10
%o A051801 -- _Reinhard Zumkeller_, Nov 23 2011
%o A051801 (PARI) a(n)=my(v=select(k->k>1,digits(n)));prod(i=1,#v,v[i]) \\ _Charles R Greathouse IV_, Nov 20 2012
%o A051801 (Python)
%o A051801 from operator import mul
%o A051801 from functools import reduce
%o A051801 def A051801(n):
%o A051801     return reduce(mul, (int(d) for d in str(n) if d != '0')) if n > 0 else 1 # _Chai Wah Wu_, Aug 23 2014
%o A051801 (Python)
%o A051801 from math import prod
%o A051801 def a(n): return prod(int(d) for d in str(n) if d != '0')
%o A051801 print([a(n) for n in range(74)]) # _Michael S. Branicky_, Jul 18 2021
%o A051801 (Swift) // Swift 5
%o A051801 A051801(n): String(n).compactMap{$0.wholeNumberValue == 0 ? 1 : $0.wholeNumberValue}.reduce(1, *) // _Egor Khmara_, Jan 15 2021
%Y A051801 Basis for A051802.
%Y A051801 See A338882 for similar sequences.
%Y A051801 See also A007953 (digital sum).
%Y A051801 Cf. A004719, A007954.
%K A051801 nonn,easy,base,nice
%O A051801 0,3
%A A051801 _Dan Hoey_, Dec 09 1999