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!)
A141139 a(n) = f(f(f(f(f(n))))), where f(n) is prime(n)-1. 2

%I #34 Jan 24 2023 06:57:57

%S 1,2,150,862,4210,6688,12496,15496,24420,40086,43206,67138,83046,

%T 88426,102646,133998,161092,169986,202966,235288,243262,279816,305068,

%U 346168,394812,438568,454500,481020,498936,521860,633160,670728,715698,741400

%N a(n) = f(f(f(f(f(n))))), where f(n) is prime(n)-1.

%p p:=ithprime: seq(p(p(p(p(p(n)-1)-1)-1)-1)-1, n=1..35); # _Emeric Deutsch_, Aug 06 2008

%t Table[Prime[Prime[Prime[Prime[Prime[n - 1] - 1] - 1] - 1] - 1] - 1, {n, 2, 50}] (* _Vincenzo Librandi_, Apr 05 2015 *)

%o (PARI) vector(50, n, prime(prime(prime(prime(prime(n)-1)-1)-1)-1)-1) \\ _Michel Marcus_, Apr 09 2015

%Y Cf. A006093, A140853, A141208, A141217.

%K nonn

%O 1,2

%A _Juri-Stepan Gerasimov_, Jul 31 2008

%E More terms from _Emeric Deutsch_, Aug 06 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 August 31 19:18 EDT 2024. Contains 375573 sequences. (Running on oeis4.)