|
| |
|
|
A064917
|
|
Iterate A064916 until a prime is reached.
|
|
4
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
COMMENTS
| Well defined since A064916(n) < n for nonprimes.
a(p) = p for all primes p.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=2,...,1000
Michael Gilleland, Some Self-Similar Integer Sequences
|
|
|
EXAMPLE
| a(6) = 3 as A064916(6) = 4 and A064916(4) = 3.
|
|
|
PROG
| (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) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 29 2009]
|
|
|
CROSSREFS
| A064916, A064918, A064921.
Sequence in context: A152984 A177980 A064921 * A154727 A065070 A070800
Adjacent sequences: A064914 A064915 A064916 * A064918 A064919 A064920
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2001
|
| |
|
|
