The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238161 Greatest common divisor of the prime factors of n, each increased by 1 0
 3, 4, 3, 6, 1, 8, 3, 4, 3, 12, 1, 14, 1, 2, 3, 18, 1, 20, 3, 4, 3, 24, 1, 6, 1, 4, 1, 30, 1, 32, 3, 4, 3, 2, 1, 38, 1, 2, 3, 42, 1, 44, 3, 2, 3, 48, 1, 8, 3, 2, 1, 54, 1, 6, 1, 4, 3, 60, 1, 62, 1, 4, 3, 2, 1, 68, 3, 4, 1, 72, 1, 74, 1, 2, 1, 4, 1, 80, 3, 4, 3, 84, 1, 6, 1, 2, 3, 90, 1, 2, 3, 4, 3, 2, 1, 98, 1, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS EXAMPLE 10 has prime factors 2 and 5, which become 3 and 6 when respectively increased by 1, and gcd(3, 6) = 3. Therefore, a(10) = 3. MATHEMATICA Table[Apply[GCD, (Transpose[FactorInteger[n]][[1]] + 1)], {n, 2, 100}] CROSSREFS Sequence in context: A262150 A325594 A104076 * A332880 A281626 A327650 Adjacent sequences:  A238158 A238159 A238160 * A238162 A238163 A238164 KEYWORD nonn,easy AUTHOR Joseph L. Pe, Feb 18 2014 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.

Last modified August 8 11:31 EDT 2020. Contains 336298 sequences. (Running on oeis4.)