The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099637 Numbers such that gcd(Sum,n) = A099635 and gcd(Sum,Product) = A099636 are not identical. Sum and Product here are the sum and product of all distinct prime factors of n. 0
 84, 132, 168, 228, 234, 252, 260, 264, 276, 308, 336, 340, 372, 396, 456, 468, 504, 516, 520, 528, 532, 552, 558, 564, 580, 588, 616, 644, 672, 680, 684, 702, 708, 740, 744, 756, 792, 804, 820, 828, 836, 852, 855, 868, 884, 912, 936, 948, 996, 1008, 1012, 1032 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Of the first million integers, 75811 (of which 6300 are odd) belong to this sequence. - Robert G. Wilson v, Nov 04 2004 LINKS Table of n, a(n) for n=1..52. EXAMPLE 84 is here because its factor list = {2,3,7} and sum = 2 + 3 + 7 = 12, product = 2*3*7 = 42, gcd(12,84) = 12, gcd(12,42) = 6 != 12. MATHEMATICA <

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 08:12 EST 2023. Contains 367575 sequences. (Running on oeis4.)