Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067077
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067077 Product of the prime factors of n equals the sum of the digits of n. +0
1
2, 3, 5, 6, 7, 24, 375, 392, 640, 2401, 4802, 4913, 6400, 7744, 17576, 42592, 64000 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The prime factors of 375 are 3,5, which have product = 15, the sum of the digits of 375, so 375 is a term of the sequence.

MATHEMATICA

f[n_] := Module[{a, l, t, r}, a = FactorInteger[n]; l = Length[a]; t = Table[a[[i]][[1]], {i, 1, l}]; r = Product[t[[i]], {i, 1, l}]]; g[n_] := Module[{b, m, s}, b = IntegerDigits[n]; m = Length[b]; s = Sum[b[[i]], {i, 1, m}]]; Select[Range[2, 10^5], f[ # ] == g[ # ] &]

CROSSREFS

Cf. A006753.

Sequence in context: A090745 A002229 A077674 this_sequence A067183 A036587 A075145

Adjacent sequences: A067074 A067075 A067076 this_sequence A067078 A067079 A067080

KEYWORD

base,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 18 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research