login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082299 Greatest common divisor of n and its sum of prime factors (with repetition). 4
1, 2, 3, 4, 5, 1, 7, 2, 3, 1, 11, 1, 13, 1, 1, 8, 17, 2, 19, 1, 1, 1, 23, 3, 5, 1, 9, 1, 29, 10, 31, 2, 1, 1, 1, 2, 37, 1, 1, 1, 41, 6, 43, 1, 1, 1, 47, 1, 7, 2, 1, 1, 53, 1, 1, 1, 1, 1, 59, 12, 61, 1, 1, 4, 1, 2, 67, 1, 1, 14, 71, 12, 73, 1, 1, 1, 1, 6, 79, 1, 3, 1, 83, 14, 1, 1, 1, 1, 89, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = GCD(n, A001414(n));

For n > 4, a(n) = n iff n is prime.

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

a(100)=GCD(2*2*5*5,2+2+5+5)=GCD(2*2*5,2*7)=2;

a(200)=GCD(2*2*2*5*5,2+2+2+5+5)=GCD(2*2*2*5,2*2*2*2)=8.

MATHEMATICA

Table[GCD[Total[Times@@@FactorInteger[n]], n], {n, 100}] (* Harvey P. Dale, Dec 27 2015 *)

CROSSREFS

Cf. A082300.

Sequence in context: A071514 A243731 A273825 * A081806 A059806 A286594

Adjacent sequences:  A082296 A082297 A082298 * A082300 A082301 A082302

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 08 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 17:27 EDT 2019. Contains 327136 sequences. (Running on oeis4.)