login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263470 Total number of positive integers < 10^n with multiplicative digital root value 0. 7

%I #26 Oct 25 2015 04:50:07

%S 0,24,476,6739,82401,902608,9394517,96122290,975700392,9854082822,

%T 99180099587,995679223590,9977627937023,99879659224379,

%U 999321444658475,9996118748668338,99978099721506172,999879067589400315,9999346524827012003,99996542810942397874

%N Total number of positive integers < 10^n with multiplicative digital root value 0.

%C Partial sums of A263476. - _Michel Marcus_, Oct 22 2015

%H Hiroaki Yamanouchi, <a href="/A263470/b263470.txt">Table of n, a(n) for n = 1..50</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MultiplicativeDigitalRoot.html">Multiplicative Digital Root.</a>

%F a(n) + A000027(n) + A263471(n) + A000217(n) + A263472(n) + A263473(n) + A263474(n) + A000217(n) + A263475(n) + A000292(n) = A002283(n).

%t Length@ Select[Range[10^# - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 0 &] & /@ Range@ 6 (* _Michael De Vlieger_, Oct 19 2015 *)

%o (PARI) t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}

%o a(n) = sum(i=1, 10^n - 1, if(t(i) == 0, 1, 0)); \\ _Altug Alkan_, Oct 19 2015

%Y Cf. A031347, A034048, A263476.

%K nonn,base

%O 1,2

%A _Martin Renner_, Oct 19 2015

%E a(9)-a(20) from _Hiroaki Yamanouchi_, Oct 25 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 14:47 EDT 2024. Contains 375417 sequences. (Running on oeis4.)