id:A099634 - OEIS Search Results

Search: id:A099634

Displaying 1-1 of 1 results found.

page 1

a[n]=GCD[P+p,P*p] where P is the largest and p the smallest prime factor of n.

+0
4

4, 3, 4, 5, 1, 7, 4, 3, 1, 11, 1, 13, 1, 1, 4, 17, 1, 19, 1, 1, 1, 23, 1, 5, 1, 3, 1, 29, 1, 31, 4, 1, 1, 1, 1, 37, 1, 1, 1, 41, 1, 43, 1, 1, 1, 47, 1, 7, 1, 1, 1, 53, 1, 1, 1, 1, 1, 59, 1, 61, 1, 1, 4, 1, 1, 67, 1, 1, 1, 71, 1, 73, 1, 1, 1, 1, 1, 79, 1, 3, 1, 83, 1, 1, 1, 1, 1, 89, 1, 1, 1, 1, 1, 1, 1, 97 (list; graph; listen)

	OFFSET	`2,1`
	EXAMPLE	`If n is prime q>2, then a[n]=GCD[q^2,2q]=q.`
	MATHEMATICA	`PrimeFactors[n_Integer] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; f[n_] := Block[{pf = PrimeFactors[n]}, GCD[pf[[1]] + pf[[ -1]], pf[[1]]*pf[[ -1]] ]]; Table[ f[n], {n, 2, 97}] (from Robert G. Wilson v Nov 04 2004)`
	CROSSREFS	`Sequence in context: A088752 A049788 A002558 this_sequence A109382 A090369 A132293` `Adjacent sequences: A099631 A099632 A099633 this_sequence A099635 A099636 A099637`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Oct 28 2004`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research