Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066031
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066031 Composite numbers n the sum of whose prime factors divides n, but which are not themselves powers of primes. +0
3
30, 60, 70, 84, 90, 105, 120, 140, 150, 168, 180, 231, 234, 240, 252, 260, 270, 280, 286, 300, 315, 336, 350, 360, 450, 456, 468, 480, 490, 504, 520, 525, 528, 532, 540, 560, 572, 588, 600, 627, 646, 672, 693, 700, 702, 720, 735, 750, 756, 805, 810, 897 (list; graph; listen)
OFFSET

1,1

COMMENT

Primes and powers of primes have been excluded from the sequence because they trivially satisfy the condition "the sum of the prime factors of n divides n". Call a term of the sequence "primitive" if it is not a multiple of some previous term; for example, 70 is primitive while 60 is not. Are there infinitely many primitive terms? See A064623.

LINKS

Pe, J., The Prime-perfect Numbers

EXAMPLE

The sum of the prime factors of 70 is 2 + 5 + 7 = 14, which divides 70.

MATHEMATICA

Select[ Range[2, 900], IntegerQ[ # / Apply[ Plus, First[ Transpose[ FactorInteger[ # ]]]]] && Mod[ #, # - EulerPhi[ # ]] != 0 & ]

CROSSREFS

Sequence in context: A040870 A051488 A051283 this_sequence A071140 A074915 A056954

Adjacent sequences: A066028 A066029 A066030 this_sequence A066032 A066033 A066034

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 12 2001

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 12 2001

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research