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 #11 Feb 07 2023 06:02:26
%S 5,13,31,53,131,103,149,283,14081,883,313,2281229,1429,79,109
%N The dividing prime prime(n+k+1) in A360297.
%C See A360297 for further details.
%o (Python)
%o from sympy import prime, nextprime
%o def A360312(n):
%o p = prime(n)
%o q = nextprime(p)
%o s, k = p+q, 1
%o while s%(q:=nextprime(q)):
%o k += 1
%o s += q
%o return q # _Chai Wah Wu_, Feb 06 2023
%Y Cf. A360297, A360311, A000040, A007504, A332542, A332580.
%K nonn,more
%O 1,1
%A _Scott R. Shannon_, Feb 03 2023