A046516 -id:A046516 - cp's OEIS frontend

A046510 Numbers with multiplicative persistence value 1.

10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 30, 31, 32, 33, 40, 41, 42, 50, 51, 60, 61, 70, 71, 80, 81, 90, 91, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 130, 131, 132, 133

Offset: 1

Patrick De Geest, Sep 15 1998

Numbers 0 to 9 have a multiplication persistence of 0, not 1. - Daniel Mondot, Mar 12 2022

			24 -> 2 * 4 = [ 8 ] -> one digit in one step.

Daniel Mondot, Table of n, a(n) for n = 1..10000
N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98.
Eric Weisstein's World of Mathematics, Multiplicative Persistence

Cf. A003001, A014120, A046501.

Numbers with multiplicative persistence m: this sequence (m=1), A046511 (m=2), A046512 (m=3), A046513 (m=4), A046514 (m=5), A046515 (m=6), A046516 (m=7), A046517 (m=8), A046518 (m=9), A352531 (m=10), A352532 (m=11).

Select[Range[10, 121], IntegerLength[Times @@ IntegerDigits[#]] <= 1 &] (* Jayanta Basu, Jun 26 2013 *)

isok(n) = my(d=digits(n)); (#d > 1) && (#digits(prod(k=1, #d, d[k])) <= 1); \\ Michel Marcus, Apr 12 2018 and Mar 13 2022

from math import prod
def ok(n): return n > 9 and prod(map(int, str(n))) < 10
print([k for k in range(134) if ok(k)]) # Michael S. Branicky, Mar 13 2022

Incorrect terms 0 to 9 removed by Daniel Mondot, Mar 12 2022

A350186 Numbers of multiplicative persistence 7 which are themselves the product of digits of a number.

Original entry on oeis.org

338688, 826686, 2239488, 3188646, 6613488, 14224896, 3416267673274176, 6499837226778624

Offset: 1

Daniel Mondot, Jan 15 2022

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 8.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181....
Equivalently:
This sequence consists of the numbers A007954(k) such that A031346(k) = 8,
These are the numbers k in A002473 such that A031346(k) = 7,
Or:
- they factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 7 steps.
Postulated to be finite and complete.
a(9), if it exists, is > 10^20000, and likely > 10^119000.

			338688 is in this sequence because:
- 338688 goes to a single digit in 7 steps: p(338688) = 27648, p(27648) = 2688, p(2688)=768, p(768)=336, p(336)=54, p(54)=20, p(20)=0.
- p(4478976) = p(13477889) = 338688, etc.

Daniel Mondot, Multiplicative Persistence Tree
Eric Weisstein's World of Mathematics, Multiplicative Persistence

Cf. A002473, A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046516 (all numbers with mp of 7).

Cf. A350180, A350181, A350182, A350183, A350184, A350185, A350187 (numbers with mp 1 to 6 and 8 to 10 that are themselves 7-smooth numbers).

mx=10^16;lst=Sort@Flatten@Table[2^i*3^j*5^k*7^l,{i,0,Log[2,mx]},{j,0,Log[3,mx/2^i]},{k,0,Log[5,mx/(2^i*3^j)]},{l,0,Log[7,mx/(2^i*3^j*5^k)]}];
Select[lst,Length@Most@NestWhileList[Times@@IntegerDigits@#&,#,#>9&]==7&]  (* code for 7-smooth numbers from A002473. - Giorgos Kalogeropoulos, Jan 16 2022 *)

A046507 Primes with multiplicative persistence value 7.

Original entry on oeis.org

186889, 188869, 246889, 248869, 264889, 269779, 279679, 279967, 284689, 288389, 288649, 288839, 296797, 297967, 376679, 376769, 377779, 379667, 379777, 426889, 444869, 467879, 467897, 468289, 468683, 469787, 469877, 478679, 478697, 478769

Offset: 1

Patrick De Geest, Sep 15 1998

			186889 -> [ 27648 ][ 2688 ][ 768 ][ 336 ][ 54 ][ 20 ][ 0 ] -> one digit in seven steps.

Daniel Mondot, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Multiplicative Persistence

Cf. A046500, A046516.

A199997 Composite numbers whose multiplicative persistence is 7.

Original entry on oeis.org

68889, 68898, 68988, 69888, 86889, 86898, 86988, 88689, 88698, 88869, 88896, 88968, 88986, 89688, 89868, 89886, 96888, 98688, 98868, 98886, 168889, 168898, 168988, 169888, 186898, 186988, 188689, 188698, 188896, 188968, 188986, 189688, 189868, 189886, 196888

Offset: 1

Jaroslav Krizek, Nov 13 2011

Complement of A046507 with respect to A046516.

			68889 -> [ 27648 ][ 2688 ][ 768 ][ 336 ][ 54 ][ 20 ][ 0 ] -> one digit in seven steps.

Cf. A046507 (primes whose multiplicative persistence is 7).

persistence[n_] := Module[{cnt = 0, k = n}, While[k > 9, cnt++; k = Times @@ IntegerDigits[k]]; cnt]; Select[Range[300000], ! PrimeQ[#] && persistence[#] == 7 &] (* T. D. Noe, Nov 23 2011 *)

cp's OEIS Frontend

A046510 Numbers with multiplicative persistence value 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Extensions

A350186 Numbers of multiplicative persistence 7 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A046507 Primes with multiplicative persistence value 7.

Views

Author

Keywords

Examples

Links

Crossrefs

A199997 Composite numbers whose multiplicative persistence is 7.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica