The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333537 Greatest prime factor of A332559. 6
 3, 3, 3, 2, 5, 3, 3, 3, 5, 5, 3, 3, 5, 5, 5, 3, 3, 3, 3, 3, 7, 5, 5, 5, 5, 7, 7, 7, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 5, 5, 13, 7, 7, 7, 7, 7, 7, 7, 3, 7, 7, 7, 7, 7, 7, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For rate of growth, see the Myers et al. link. - N. J. A. Sloane, Apr 30 2020 LINKS N. J. A. Sloane, Table of n, a(n) for n = 1..10000. J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004:14000 [math.NT], April 2020. MATHEMATICA a[n_] := Module[{k, p = n}, For[k = 1, True, k++, p *= (n+k); If[Divisible[ p, n+k+1], Return[FactorInteger[n+k+1][[-1, 1]]]]]]; Array[a, 1000] (* Jean-François Alcover, Aug 17 2020 *) CROSSREFS Cf. A006530, A061836, A332558, A332559, A332560, A332561. For records see A333538, A333541, A333542. Sequence in context: A307486 A259301 A200777 * A227827 A033700 A122916 Adjacent sequences: A333534 A333535 A333536 * A333538 A333539 A333540 KEYWORD nonn AUTHOR N. J. A. Sloane, Apr 12 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 22 08:18 EST 2024. Contains 370240 sequences. (Running on oeis4.)