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!)
A152446 a(0) = 1. a(1) = 2. For n >= 2, a(n) = the largest prime <= a(n-1)*a(n-2). 2

%I #8 Aug 27 2015 00:01:05

%S 1,2,2,3,5,13,61,787,47981,37761019,1811811452611,

%T 68415846686461570603,123956614566609409301849965194431,

%U 8480596737961958410971738003633556174455988528911421

%N a(0) = 1. a(1) = 2. For n >= 2, a(n) = the largest prime <= a(n-1)*a(n-2).

%t a = {1, 2}; Do[AppendTo[a, Prime[PrimePi[a[[ -1]]*a[[ -2]]]]], {9}]; a (* _Stefan Steinerberger_, Dec 06 2008 *)

%Y Cf. A152445.

%K nonn

%O 0,2

%A _Leroy Quet_, Dec 04 2008

%E Extended by _Ray Chandler_ and _Stefan Steinerberger_, Dec 05 2008

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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)