OFFSET
1,1
COMMENTS
a(n) satisfies the following inequality: (1/4)*(n^2 + 3*n + 1) <= a(n) <= (1/4)*(n+2)^2. [Corrected by M. F. Hasler, Apr 08 2015]
The present sequence is the special case a(n) = a(2,n) with a more general a(m, n) := a(m, n-1) + gpf(a(m, n-1)), a(m, 1) := m, where gpf(x) := "greatest prime factor of x" = A006530(x). Also a(a(r,k), n) = a(r,n+k-1), for all n,k in N\{0} and all r in N\{0,1}; a(prime(k), n) = a(prime(i), n + prime(k) - prime(i)), for all k,i,n in N\{0}, with k >= i, n >= prime(k-1) and with prime(x) := x-th prime.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = p(m)*(n+2-p(m)), where p(k) is the k-th prime and m is the smallest index such that n+2 <= p(m) + p(m+1). - Max Alekseyev, Oct 21 2008
a(n+1) = A070229(a(n)). - Reinhard Zumkeller, Nov 07 2015
EXAMPLE
a(2,2) = 4 because 2 + gpf(2) = 2 + 2 = 4;
a(2,3) = 6 because 4 + gpf(4) = 4 + 2 = 6.
MATHEMATICA
f[n_]:=Last[First/@FactorInteger[n]]; Join[{a=2}, Table[a+=f[a], {n, 2, 100}]] (* Vladimir Joseph Stephan Orlovsky, Feb 08 2011*)
NestList[#+FactorInteger[#][[-1, 1]]&, 2, 60] (* Harvey P. Dale, Dec 02 2012 *)
PROG
(Haskell)
a036441 n = a036441_list !! (n-1)
a036441_list = tail a076271_list
-- Reinhard Zumkeller, Nov 08 2015, Nov 14 2011
(PARI) a(n)=(n+2-if(n\2+1<(p=nextprime(n\2+1))&&n+1<p+n=precprime(p-1), p=n, p))*p \\ M. F. Hasler, Apr 08 2015
CROSSREFS
KEYWORD
eigen,nice,nonn
AUTHOR
Frederick Magata (frederick.magata(AT)uni-muenster.de)
EXTENSIONS
Better description from Reinhard Zumkeller, Feb 04, 2002
Edited by M. F. Hasler, Apr 08 2015
STATUS
approved