Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067170
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067170 Numbers n such that sum of the cubes of the prime factors of n equals the sum of the cubes of the digits of n. +0
1
2, 3, 5, 7, 250, 735, 2500, 25000, 250000 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The prime factors of 735 are 3,5,7, the sum of whose cubes = 495 = sum of the squares of the digits of 735; so 735 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 = Sum[(t[[i]])^3, {i, 1, l}]]; g[n_] := Module[{b, m, s}, b = IntegerDigits[n]; m = Length[b]; s = Sum[(b[[i]])^3, {i, 1, m}]]; Select[Range[2, 10^6], f[ # ] == g[ # ] &]

CROSSREFS

Cf. A006753.

Adjacent sequences: A067167 A067168 A067169 this_sequence A067171 A067172 A067173

Sequence in context: A122764 A064157 A067184 this_sequence A090719 A088297 A052024

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research