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!)
A215848 Primes > 3. 6

%I #17 Mar 28 2019 12:03:22

%S 5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,

%T 101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,

%U 191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281

%N Primes > 3.

%C Or, prime sums of primes (without repetition).

%C Or, smallest prime > n-th odd prime.

%C Or, primes p such that p*(p+1)/2-1 is a composite.

%C Note that p*(p+1)/2-1 = (1/2)*(p - 1)*(p + 2), also 3*(3+1)/2-1 = 5. - _Joerg Arndt_, Jan 12 2011.

%C The inclusion of this sequence in the OEIS is justified by the fact that a number of other sequences can be more simply described using it, and also so that Superseeker can make use of it. - _N. J. A. Sloane_, Aug 24 2012

%C Also level number where the total number of faces is increased by 4 in the perspective view of the stepped pyramid described in A245092. - _Omar E. Pol_, Mar 20 2019

%F a(n) = A000040(n+2). - _Omar E. Pol_, Mar 20 2019

%o (PARI) a(n)=prime(n+2) \\ _Charles R Greathouse IV_, Aug 26 2011

%o (PARI) vecextract(primes(52), "3..") \\ _Charles R Greathouse IV_, Aug 26 2011

%Y Cf. A000040, A237593, A245092.

%K nonn,easy

%O 1,1

%A _Juri-Stepan Gerasimov_ , Nov 29 2009

%E Entries checked by _R. J. Mathar_, Mar 18 2010

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 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)