[go: up one dir, main page]
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
5, 6, 8, 10, 14, 16, 20, 22, 26, 32, 34, 40, 44, 46, 50, 56, 62, 64, 70, 74, 76, 82, 86, 92, 100, 104, 106, 110, 112, 116, 130, 134, 140, 142, 152, 154, 160, 166, 170, 176, 182, 184, 194, 196, 200, 202, 214, 226, 230, 232, 236, 242, 244, 254, 260, 266, 272, 274 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) = A116366(n-1,1) for n>1. - Reinhard Zumkeller, Feb 06 2006
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
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = 2*A098090(n-1) for n > 1. - Reinhard Zumkeller, Sep 14 2006
MATHEMATICA
Prime[Range[70]]+3 (* Vladimir Joseph Stephan Orlovsky, Apr 29 2008 *)
PROG
(PARI) for(x=1, 100, print1(prime(x)+3, ", "))
(Magma) [p+3: p in PrimesUpTo(500)]; // Vincenzo Librandi, Nov 27 2013
(Sage) [nth_prime(n)+3 for n in (1..70)] # G. C. Greubel, May 18 2019
(GAP) List([1..70], n-> Primes[n]+3) # G. C. Greubel, May 18 2019
CROSSREFS
Sequence in context: A331199 A074819 A330916 * A279646 A291640 A088766
Adjacent sequences: A113932 A113933 A113934 * A113936 A113937 A113938
KEYWORD
nonn,easy
AUTHOR
Jorge Coveiro, Jan 30 2006
STATUS
approved

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 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)