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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099635 a(n)=GCD(sum of all prime factors of n,n). 2
1, 2, 3, 2, 5, 1, 7, 2, 3, 1, 11, 1, 13, 1, 1, 2, 17, 1, 19, 1, 1, 1, 23, 1, 5, 1, 3, 1, 29, 10, 31, 2, 1, 1, 1, 1, 37, 1, 1, 1, 41, 6, 43, 1, 1, 1, 47, 1, 7, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 10, 61, 1, 1, 2, 1, 2, 67, 1, 1, 14, 71, 1, 73, 1, 1, 1, 1, 6, 79, 1, 3, 1, 83, 12, 1, 1, 1, 1, 89, 10, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

n=25: a[25]=GCD[5,25]=5

MATHEMATICA

PrimeFactors[n_Integer] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; f[n_] := GCD[Plus @@ PrimeFactors[n], n]; Table[ f[n], {n, 93}] (* from Robert G. Wilson v Nov 04 2004 *)

CROSSREFS

Cf. A099634, A099636.

Sequence in context: A020500 A014963 A099636 * A178380 A178375 A086847

Adjacent sequences:  A099632 A099633 A099634 * A099636 A099637 A099638

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 28 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 17:10 EST 2012. Contains 205644 sequences.