Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067184
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067184 Numbers n such that sum of the squares of the prime factors of n equals the sum of the squares of the digits of n. +0
1
2, 3, 5, 7, 250, 735, 792, 2500, 4992, 9075, 11760, 25000, 30625, 67914, 91476, 117600, 185625, 187278, 250000, 264992, 523908, 630784, 855360, 1082565, 1176000, 2395008, 2500000, 2546775, 2898350, 3608550, 3833280, 4299750 (list; graph; listen)
OFFSET

1,1

EXAMPLE

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

CROSSREFS

Cf. A006753.

Sequence in context: A029978 A122764 A064157 this_sequence A067170 A090719 A088297

Adjacent sequences: A067181 A067182 A067183 this_sequence A067185 A067186 A067187

KEYWORD

base,nonn

AUTHOR

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

EXTENSIONS

a(16)-a(32) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 29 2009

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research