Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068999
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068999 Numbers n such that n = (sum of distinct prime factors of n)(product of distinct prime factors of n). +0
1
4, 9, 25, 49, 121, 169, 289, 300, 361, 504, 529, 841, 961, 980, 1056, 1369, 1404, 1575, 1681, 1849, 2209, 2600, 2736, 2809, 3481, 3721, 4489, 4851, 5041, 5329, 6241, 6375, 6696, 6889, 7436, 7448, 7695, 7921, 9409, 9639, 10201, 10304, 10609, 11375, 11449 (list; graph; listen)
OFFSET

1,1

COMMENT

Contains all squares of primes (A001248).

EXAMPLE

The prime factors of 300 are 2,3,5, the sum and product of which are 10,30 respectively, which multiply to 300. Hence 300 belongs to the sequence.

MATHEMATICA

h[n_] := Module[{a, l }, a = FactorInteger[n]; l = Length[a]; Sum[a[[i]][[1]], {i, 1, l}]*Product[a[[i]][[1] ], {i, 1, l}] == n]; Select[Range[2, 10^4], h[ # ] &]

pf[n_] := First /@ FactorInteger[n]; Select[Range[11500], (Plus @@ pf[ # ])*(Times @@ pf[ # ]) == # &] (*Chandler*)

CROSSREFS

Sequence in context: A158144 A158145 A082180 this_sequence A077438 A001248 A052043

Adjacent sequences: A068996 A068997 A068998 this_sequence A069000 A069001 A069002

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Mar 20 2002

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 14 2005

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 November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research