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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068843 Smallest prime in the first occurrence of a nondecreasing difference for a set of n successive primes. 1
37, 11, 17, 2, 1091, 2897, 13451, 448363, 7407287, 34400141, 255030533 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

This is the same as asking for the smallest prime in the first occurrence of a nonnegative second difference for a set of n successive primes.

EXAMPLE

a(4) = 2 as the prime set is 2,3,5,7,11 with nondecreasing successive differences 1,2,2,4.

MATHEMATICA

(* used to find a(11) *) k = 0; While[p = Select[ Range[ k*10^6, (k + 1)*10^6 + 10^4], PrimeQ[ # ] & ]; l = Length[p]; d1 = Take[p, 1 - l] - Take[p, l - 1]; d2 = Take[d1, 2 - l] - Take[d1, l - 2]; s = Sign[ Sign[d2] + 1]; q = StringPosition[ ToString[s], StringDrop[ StringDrop[ ToString[ Table[1, {10}]], 1], -1]]; q == {}, k++ ]; p[[ (q[[1, 1]] + 1)/3 ]]

CROSSREFS

Sequence in context: A051316 A178199 A107812 * A177378 A033357 A093860

Adjacent sequences:  A068840 A068841 A068842 * A068844 A068845 A068846

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 10 2002

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 10 2002 and Dec 08, 2002

a(12) > 2.7*10^9

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 14:07 EST 2012. Contains 205930 sequences.