This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A215848 #21 Nov 08 2024 08:41:36 %S A215848 5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97, %T A215848 101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181, %U A215848 191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281 %N A215848 Primes > 3. %C A215848 Or, prime sums of primes (without repetition). %C A215848 Or, smallest prime > n-th odd prime. %C A215848 Or, primes p such that p*(p+1)/2-1 is a composite. %C A215848 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 A215848 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 A215848 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 A215848 a(n) = A000040(n+2). - _Omar E. Pol_, Mar 20 2019 %t A215848 Prime[Range[3, 60]] (* _Paul F. Marrero Romero_, Nov 07 2024 *) %o A215848 (PARI) a(n)=prime(n+2) \\ _Charles R Greathouse IV_, Aug 26 2011 %o A215848 (PARI) vecextract(primes(52), "3..") \\ _Charles R Greathouse IV_, Aug 26 2011 %Y A215848 Cf. A000040, A237593, A245092. %K A215848 nonn,easy %O A215848 1,1 %A A215848 _Juri-Stepan Gerasimov_ , Nov 29 2009 %E A215848 Entries checked by _R. J. Mathar_, Mar 18 2010