A064917 a(n) is the result of beginning with n and iterating k -> A064916(k) until a prime is reached.

2, 3, 3, 5, 3, 7, 5, 5, 3, 11, 7, 13, 5, 7, 5, 17, 3, 19, 11, 5, 7, 23, 13, 5, 5, 11, 7, 29, 5, 31, 17, 13, 3, 11, 19, 37, 11, 7, 5, 41, 7, 43, 23, 17, 13, 47, 5, 13, 5, 19, 11, 53, 7, 7, 29, 5, 5, 59, 31, 61, 17, 23, 13, 17, 3, 67, 11, 5, 19, 71, 37, 73, 11, 11, 7, 17, 5, 79, 41, 29, 7

Offset: 2

Author

Reinhard Zumkeller, Oct 14 2001

Keywords

• nonn

Comments

Well-defined since A064916(n) < n for nonprimes.

a(p) = p for all primes p.

Examples

			a(6) = 3 as A064916(6) = 4 and A064916(4) = 3.
		

Links

• Harry J. Smith, Table of n, a(n) for n = 2..1000
• Michael Gilleland, Some Self-Similar Integer Sequences

Crossrefs

Cf. A064916, A064918, A064921.

Programs

PARI

lpf(n)= { local(f); f=factor(n); return(f[1, 1]) } { for (n=2, 1000, m=n; while (!isprime(m), L=lpf(m); m=m / L + L - 1); write("b064917.txt", n, " ", m) ) } \\ Harry J. Smith, Sep 29 2009