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!)
A084758 The slowest increasing sequence of primes such that difference of successive terms is unique. 26

%I #25 Oct 30 2018 10:31:02

%S 2,3,5,11,19,23,37,47,59,79,97,113,137,163,191,223,257,293,331,353,

%T 383,431,487,541,587,631,673,733,773,823,881,947,1009,1061,1129,1193,

%U 1277,1367,1439,1531,1601,1697,1777,1871,1949,2053,2129,2203,2309,2411,2521

%N The slowest increasing sequence of primes such that difference of successive terms is unique.

%C The sequence of successive differences is 1,2,6,8,4,14,10,12,20,18,16,... Conjecture: every even number is a term of this sequence. For every even number e there exists some k such that a(k) - a(k-1) = e.

%C The slowest increasing sequence of primes such that each difference between successive terms is unique. - _Zak Seidov_, Feb 10 2015

%H Zak Seidov, <a href="/A084758/b084758.txt">Table of n, a(n) for n = 1..1000</a>

%e After 23, the next term is 37 and not 29 or 31 as 29-23= 11-5 =6, 31-23 = 19-11=8.

%t diffs = {}; prms = {2}; p = 2; Do[While[p = NextPrime[p]; d = p - prms[[-1]]; MemberQ[diffs, d]]; AppendTo[diffs, d]; AppendTo[prms, p], {100}]; prms (* _T. D. Noe_, Nov 01 2011 *)

%Y Cf. A084759, A121862.

%K nonn

%O 1,1

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 17 2003

%E More terms from _David Wasserman_, Jan 05 2005

%E Definition corrected by _Zak Seidov_, Nov 01 2011

%E Definition corrected by _Zak Seidov_, Feb 11 2015

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 July 14 19:09 EDT 2024. Contains 374323 sequences. (Running on oeis4.)