A333537 Greatest prime factor of A332559.

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

Offset: 1

Author

N. J. A. Sloane, Apr 12 2020

Keywords

• nonn

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.

Crossrefs

Cf. A006530, A061836, A332558, A332559, A332560, A332561.

For records see A333538, A333541, A333542.

Programs

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 *)