login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A023509
Greatest prime divisor of prime(n) + 1.
12
3, 2, 3, 2, 3, 7, 3, 5, 3, 5, 2, 19, 7, 11, 3, 3, 5, 31, 17, 3, 37, 5, 7, 5, 7, 17, 13, 3, 11, 19, 2, 11, 23, 7, 5, 19, 79, 41, 7, 29, 5, 13, 3, 97, 11, 5, 53, 7, 19, 23, 13, 5, 11, 7, 43, 11, 5, 17, 139, 47, 71, 7, 11, 13, 157, 53, 83, 13, 29, 7, 59, 5, 23, 17, 19, 3, 13
OFFSET
1,1
FORMULA
a(n) = A006530(A008864(n)). - R. J. Mathar, Feb 06 2019
MATHEMATICA
Table[FactorInteger[Prime[n] + 1][[-1, 1]], {n, 100}]
PROG
(PARI) A023509(n) = {local(f); f=factor(prime(n)+1); f[matsize(f)[1], 1]} \\ Michael B. Porter, Feb 02 2010
CROSSREFS
Sequence in context: A097618 A368276 A039639 * A115041 A039641 A198729
KEYWORD
nonn
STATUS
approved