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!)
A113935 a(n) = prime(n) + 3. 14

%I #22 Sep 08 2022 08:45:23

%S 5,6,8,10,14,16,20,22,26,32,34,40,44,46,50,56,62,64,70,74,76,82,86,92,

%T 100,104,106,110,112,116,130,134,140,142,152,154,160,166,170,176,182,

%U 184,194,196,200,202,214,226,230,232,236,242,244,254,260,266,272,274

%N a(n) = prime(n) + 3.

%C a(n) = A116366(n-1,1) for n>1. - _Reinhard Zumkeller_, Feb 06 2006

%C a(n) = A000040(n) + 3 = A008864(n) + 2 = A052147(n) + 1 = A175221(n) - 1 = A175222(n) - 2 = A139049(n) - 3 = A175223(n) - 4 = A175224(n) - 5 = A140353(n) - 6 = A175225(n) - 7. - _Jaroslav Krizek_, Mar 06 2010

%H Vincenzo Librandi, <a href="/A113935/b113935.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = 2*A098090(n-1) for n > 1. - _Reinhard Zumkeller_, Sep 14 2006

%t Prime[Range[70]]+3 (* _Vladimir Joseph Stephan Orlovsky_, Apr 29 2008 *)

%o (PARI) for(x=1,100,print1(prime(x)+3,","))

%o (Magma) [p+3: p in PrimesUpTo(500)]; // _Vincenzo Librandi_, Nov 27 2013

%o (Sage) [nth_prime(n)+3 for n in (1..70)] # _G. C. Greubel_, May 18 2019

%o (GAP) List([1..70], n-> Primes[n]+3) # _G. C. Greubel_, May 18 2019

%K nonn,easy

%O 1,1

%A _Jorge Coveiro_, Jan 30 2006

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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)