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!)
 A112757 Greatest common divisors of consecutive 5-smooth numbers. 3
 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 2, 2, 4, 1, 1, 3, 2, 4, 4, 5, 3, 2, 2, 6, 4, 8, 3, 5, 1, 9, 6, 4, 4, 12, 5, 1, 1, 9, 6, 10, 2, 18, 12, 8, 8, 9, 15, 3, 1, 2, 2, 18, 12, 20, 4, 36, 15, 3, 16, 5, 27, 18, 30, 6, 2, 4, 4, 36, 24, 25, 5, 8, 27, 45, 9, 3, 6, 32, 10, 54, 36, 60, 12, 4, 8, 8, 45, 9, 48, 15, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..750 from Harvey P. Dale) FORMULA a(n) = gcd(A051037(n), A051037(n+1)). MATHEMATICA GCD@@#&/@(Partition[Select[Range[2000], Max[Transpose[ FactorInteger[ #]] [[1]]]<6&], 2, 1]) (* Harvey P. Dale, Dec 24 2015 *) CROSSREFS Cf. A051037, A112752. Sequence in context: A240750 A181118 A179009 * A219794 A286334 A118492 Adjacent sequences:  A112754 A112755 A112756 * A112758 A112759 A112760 KEYWORD nonn AUTHOR Reinhard Zumkeller, Sep 18 2005 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 September 25 22:13 EDT 2020. Contains 337346 sequences. (Running on oeis4.)