A153401 - cp's OEIS frontend

A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2A000695(k)+a(n))+2(2A000695(l)+a(n)), both of numbers 2A000695(k)+a(n) and 2A000695(l)+a(n) are primes.

%I A153401 #5 Dec 18 2018 11:48:53
%S A153401 1,3,3,3,1,3,3,3,1,3,3,3,1,3,3,3,7,3,9,1,1,5,3,7,9,3,7,1,1,19,3,0,5,7,
%T A153401 3,3,5
%N A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2*A000695(k)+a(n))+2(2*A000695(l)+a(n)), both of numbers 2*A000695(k)+a(n) and 2*A000695(l)+a(n) are primes.
%C A153401 For a given c>=3, every odd N>=3c is a unique sum of the form (2*A000695(k)+c) +2(2*A000695(l)+c).
%Y A153401 Cf. A046927, A103151, A000695, A145812, A147568.
%K A153401 nonn,more
%O A153401 4,2
%A A153401 _Vladimir Shevelev_, Dec 25 2008

cp's OEIS Frontend

A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2*A000695(k)+a(n))+2(2*A000695(l)+a(n)), both of numbers 2*A000695(k)+a(n) and 2*A000695(l)+a(n) are primes.

A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2A000695(k)+a(n))+2(2A000695(l)+a(n)), both of numbers 2A000695(k)+a(n) and 2A000695(l)+a(n) are primes.