Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #49 Jan 31 2024 07:57:54
%S 1,2,1,6,2,9,2,12,13,14,4,17,2,20,21,22,4,25,2,28,29,30,4,33,34,35,36,
%T 37,6,40,2,43,44,45,46,47,6,50,51,52,4,55,2,58,59,60,4,63,64,65,66,67,
%U 6,70,71,72,73,74,6,77,2,80,81,82,83,84,6,87,88,89,4,92,2,95,96
%N a(n) = n - prevprime(n) if n is prime, n + primepi(n) otherwise; a(2) = 2.
%C prevprime(n) = A151799(n) is the largest prime < n.
%C a(n) = 2 iff n=2 or n is the larger prime of a twin prime pair (A006512).
%t Table[If[n<3, n, If[PrimeQ[n], n-NextPrime[n,-1], n+PrimePi[n]]],{n,75}] (* _James C. McMahon_, Dec 19 2023 *)
%o (PARI) a(n) = if (isprime(n), n - precprime(n-1), n + primepi(n)); \\ _Michel Marcus_, Dec 18 2023
%Y Cf. A000720, A005171, A010051, A006512, A095117, A151799.
%Y Cf. A368196 (trajectories).
%K nonn,easy
%O 1,2
%A _Hendrik Kuipers_, Dec 18 2023