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!)
A095938 a(n+1) = (a(n)-1)-th prime + 1. 0

%I #23 Aug 07 2020 12:12:24

%S 2,3,4,6,12,32,128,710,5382,52712,648392,9737334,174440042,3657500102,

%T 88362852308,2428095424620,75063692618250,2586559730396078,

%U 98552043847093520,4123221751654370052,188272405179937051082,9332039515881088707362,499720579610303128776792,28785866289100396890228042

%N a(n+1) = (a(n)-1)-th prime + 1.

%H N. Lygeros, <a href="https://lygeros.org/139-en/">G-test</a>. [From Herman Jamke (hermanjamke(AT)fastmail.fm), Dec 06 2008]

%t NestList[Prime[ # - 1] + 1 &, 2, 16] (* _Robert G. Wilson v_ *)

%o (PARI) a(n)=if(n<2,2,prime(a(n-1)-1)+1);

%o for(n=1,10,print1(a(n),","));

%Y Equals A007097 + 1.

%K nonn

%O 1,1

%A Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 13 2004

%E a(19)-a(24) from _Giovanni Resta_, using terms of A007097, Apr 03 2019

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 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)