The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114599 a(1)=a(2)=1. For n >= 3, a(n) = 1 + (A114600(n-2))*(A114600(n-1)). 1
 1, 1, 2, 3, 7, 22, 78, 144, 40, 16, 11, 23, 254, 2922, 61850, 602420, 409448, 42038, 2669414, 38065410, 255320214, 315752716934, 22408767609924, 18684193273697426172, 85136306795697966858, 4400725717987783759574480 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE 13 is the greatest prime dividing a(7) = 78 and 3 is the greatest prime dividing a(8) = 144. So a(9) = 1 + 13*3 = 40. MATHEMATICA f[n_] := If[n == 1, 1, FactorInteger[n][[ -1, 1 ]]]; g[l_] := Append[l, 1 + Times @@ f /@ Take[l, -2]]; Nest[g, {1, 1}, 30] (* Ray Chandler, Dec 26 2005 *) CROSSREFS Cf. A006530, A114600. Sequence in context: A187014 A053966 A010738 * A094062 A038159 A077210 Adjacent sequences:  A114596 A114597 A114598 * A114600 A114601 A114602 KEYWORD nonn AUTHOR Leroy Quet, Dec 13 2005 EXTENSIONS Extended by Ray Chandler, Dec 26 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 07:59 EDT 2021. Contains 342946 sequences. (Running on oeis4.)