Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079007
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079007 a(n) = smallest prime p_k such that the n successive differences between the primes p_k through p_(k+n) are all distinct. +0
9
2, 2, 2, 17, 83, 113, 491, 1367, 1801, 5869, 15919, 34883, 70639, 70657, 214867, 214867, 2515871, 3952733, 13010143, 30220163, 60155567, 69931991, 203674907, 1092101119, 1363592621, 1363592677, 2124140323 (list; graph; listen)
OFFSET

0,1

EXAMPLE

a(0)=2; a(1) = 2 from {2,3} with a single difference 1; a(2) = 2 from {2,3,5}, with two distinct differences 1, 2.

a(5) = p_30 = 113 because 113 is followed by 127, 131, 137, 139, 149, with 5 different difference: 14, 4, 6, 2, 10; and no smaller prime has this property.

MATHEMATICA

f[k_, n_] := Block[{p = Table[ Prime[i], {i, k, k + n - 1}]}, Length[ Union[Drop[p, 1] - Drop[p, -1]]]]; k = 1; Do[ While[ f[k, n] != n - 1, k++ ]; Print[ Prime[k]], {n, 1, 22}]

CROSSREFS

Cf. A001223, A068843, A053597, A078515. Different from A079889.

Sequence in context: A025521 A068218 A098919 this_sequence A087238 A099640 A140283

Adjacent sequences: A079004 A079005 A079006 this_sequence A079008 A079009 A079010

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 03 2002

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com) and njas, Jan 05 2002

More terms from Don Reble (djr(AT)nk.ca), Jan 15 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research