login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051634 Strong primes: p(n)>(p(n-1)+p(n+1))/2. 28
11, 17, 29, 37, 41, 59, 67, 71, 79, 97, 101, 107, 127, 137, 149, 163, 179, 191, 197, 223, 227, 239, 251, 269, 277, 281, 307, 311, 331, 347, 367, 379, 397, 419, 431, 439, 457, 461, 479, 487, 499, 521, 541, 557, 569, 587, 599 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Primes p(n) such that p(n)-p(n-1) > p(n+1)-p(n) [from Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jan 01 2011).

REFERENCES

A. Murthy, Smarandache Notions Journal, Vol. 11 N. 1-2-3 Spring 2000

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

11 belongs to the sequence because 11>(7+13)/2

MATHEMATICA

Transpose[Select[Partition[Prime[Range[10^2]], 3, 1], #[[2]]>(#[[1]]+#[[3]])/2 &]][[2]] (from Vladimir Orlovsky (4vladimir(AT)gmail.com), May 01 2008)

p=Prime[Range[200]]; p[[Flatten[1+Position[Sign[Differences[p, 2]], -1]]]]

PROG

(PARI) p=2; q=3; forprime(r=5, 1e4, if(2*q>p+r, print1(q", ")); p=q; q=r) \\ Charles R Greathouse IV, Jul 19 2011

CROSSREFS

Cf. A006562, A051635.

Sequence in context: A191061 A110055 A105886 * A038918 A166307 A128464

Adjacent sequences:  A051631 A051632 A051633 * A051635 A051636 A051637

KEYWORD

nice,nonn

AUTHOR

Felice Russo (frusso(AT)micron.com), Nov 15 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:48 EST 2012. Contains 205955 sequences.