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!)
A255000 Prime(n + d(n)), with d(n) = prime(n+1) - prime(n), for n >= 1. 0

%I #26 Sep 08 2022 08:46:11

%S 3,7,11,19,17,29,23,37,47,37,59,53,47,61,73,79,67,89,83,79,103,101,

%T 109,131,109,107,127,113,137,193,149,163,149,193,157,181,191,181,197,

%U 199,191,239,197,223,211,271,277,239,233,251,269,251,307,281,283,293

%N Prime(n + d(n)), with d(n) = prime(n+1) - prime(n), for n >= 1.

%C This sequence is not a mere permutation of primes, for some of them will be excluded from it, e.g., 5, 13, 31, 71, 97.

%F a(n) = prime(n + prime(n + 1) - prime(n)) = A000040(n + A001223(n)).

%e a(1) = prime(1 + prime(2) - prime(1)) = prime(1 + 3 - 2) = prime(2) = 3.

%t Table[Prime[n + Prime[n + 1] - Prime[n]], {n, 100}]

%o (PARI) vector(100,n,prime(n+prime(n+1)-prime(n))) \\ _Derek Orr_, Feb 19 2015

%o (Magma) [NthPrime(n+NthPrime(n+1)-NthPrime(n)): n in [1..60]]; // _Vincenzo Librandi_, Feb 23 2015

%o (Sage) [nth_prime(n+nth_prime(n+1)-nth_prime(n)) for n in (1..60)] # _Bruno Berselli_, Mar 02 2015

%Y Cf. A000040, A001223, A082910.

%K nonn,easy

%O 1,1

%A _Waldemar Puszkarz_, 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 24 13:53 EDT 2024. Contains 374584 sequences. (Running on oeis4.)