id:A099636 - OEIS Search Results

Search: id:A099636

Displaying 1-1 of 1 results found.

page 1

a(n)=GCD(sum of all prime factors of n, product of all prime factors of n).

+0
3

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, 6, 1, 1, 1, 1, 89, 10, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`n=84: a[84]=GCD[2.3.7,2+3+7]=GCD[42,12]=6`
	MATHEMATICA	`PrimeFactors[n_Integer] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; f[n_] := Block[{pf = PrimeFactors[n]}, GCD[Plus @@ pf, Times @@ pf]]; Table[ f[n], {n, 93}] (from Robert G. Wilson v Nov 04 2004)`
	CROSSREFS	`Cf. A099634, A099635.` `Sequence in context: A014973 A020500 A014963 this_sequence A099635 A086847 A098228` `Adjacent sequences: A099633 A099634 A099635 this_sequence A099637 A099638 A099639`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Oct 28 2004`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research