

A319507


Smallest number of multiplicativeadditive divisors persistence n.


0




OFFSET

0,2


COMMENTS

To compute the "multiplicativeadditive divisors persistence" of a number, we proceed as follows. Form the product of the digits of the number (A007954) divided by the sum of the digits (A007953). Repeat this process until you reach 0 or 1. If we reach a noninteger, we write 0. The "multiplicativeadditive divisors persistence" is the number of steps to reach 0 or 1.
For instance: the multiplicativeadditive divisors persistence of 874 is 1, because 874 > 8 * 7 * 4 / (8 + 7 + 4) = 224/19. This is not an integer, so the process stops after one step.


LINKS

Table of n, a(n) for n=0..6.


EXAMPLE

The multiplicative additive divisors persistence of 24778899 is 4: 24778899 > (2032128/54=) 37632 > (756/21=) 36 > (18/9=) 2 > (2/2=) 1.


CROSSREFS

Cf. A038367, A126789, A003001, A006050, A007953, A007954, A031346.
Sequence in context: A200571 A213985 A203021 * A001070 A095229 A047832
Adjacent sequences: A319504 A319505 A319506 * A319508 A319509 A319510


KEYWORD

nonn,base,more


AUTHOR

Pieter Post, Sep 21 2018


EXTENSIONS

Offset set to 0.  R. J. Mathar, Jun 30 2020


STATUS

approved



