login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #14 Oct 11 2019 16:24:48

%S 1,1,2,3,7,22,78,144,40,16,11,23,254,2922,61850,602420,409448,42038,

%T 2669414,38065410,255320214,315752716934,22408767609924,

%U 18684193273697426172,85136306795697966858,4400725717987783759574480

%N a(1)=a(2)=1. For n >= 3, a(n) = 1 + (A114600(n-2))*(A114600(n-1)).

%e 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.

%t 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 *)

%Y Cf. A006530, A114600.

%K nonn

%O 1,3

%A _Leroy Quet_, Dec 13 2005

%E Extended by _Ray Chandler_, Dec 26 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)