The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A067183 Product of the prime factors of n equals the product of the digits of n. 2
1, 2, 3, 5, 6, 7, 135, 175, 735, 1176, 1715, 131712 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Terms are zeroless 7-smooth numbers (cf. A238985). - David A. Corneth, Sep 14 2022
LINKS
EXAMPLE
The prime factors of 1176 are 2,3,7 which have product = 42, the product of the digits of 1176, so 1176 is a term of the sequence.
MATHEMATICA
Do[ If[ Apply[ Times, Transpose[ FactorInteger[n]] [[1]] ] == Apply[ Times, IntegerDigits[n]], Print[n]], {n, 2, 2*10^7} ]
Select[Range[2, 1000000], Times@@Transpose[FactorInteger[#]][[1]] == Times@@ IntegerDigits[#]&] (* Harvey P. Dale, Mar 19 2012 *)
PROG
(PARI) is(n) = {if(n == 1, return(1)); my(f = factor(n, 7), d = digits(n)); if(f[#f~, 1] > 7, return(0)); vecprod(f[, 1]) == vecprod(d)} \\ David A. Corneth, Sep 14 2022
CROSSREFS
Sequence in context: A067077 A370688 A357132 * A269670 A333480 A036587
KEYWORD
nonn,base,fini,full
AUTHOR
Joseph L. Pe, Feb 18 2002
EXTENSIONS
Edited and extended by Robert G. Wilson v, Feb 19 2002
a(1)=1 inserted by Alois P. Heinz, Sep 14 2022
STATUS
approved

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 June 12 18:55 EDT 2024. Contains 373360 sequences. (Running on oeis4.)