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!)
A085910 a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n). 1

%I #6 Jul 29 2017 13:22:23

%S 5,3,13,17,7,11,37,31,41,23,19,29,67,53,47,71,73,43,59,61,97,131,359,

%T 79,107,109,101,103,293,163,83,149,181,137,157,151,127,173,167,191,

%U 139,179,223,227,211,199,193,197,277,251,269,283,233,263,257,239,331,229,311

%N a(n) = smallest prime(k) not equal to prime(n) and not included earlier, such that A001223(k) = A001223(n), i.e., prime(k+1) - prime(k) = prime(n+1) - prime(n).

%C a(1) = 0. Conjecture: a rearrangement of odd primes for n > 1.

%Y Cf. A085909.

%K nonn

%O 0,1

%A _Amarnath Murthy_, Jul 09 2003

%E Corrected and extended by _David Wasserman_, Feb 24 2004

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 May 2 06:11 EDT 2024. Contains 372178 sequences. (Running on oeis4.)