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 #8 Dec 17 2019 13:51:45
%S 1,16,7,2,8,17,11,12,18,3,26,29,19,46,10,9,20,23,36,4,5,134,24,39,15,
%T 47,56,28,33,25,64,50,21,118,205,42,87,172,38,41,126,193,78,51,65,108,
%U 196,48,14,111,105,92,123,6,35,22,75,346,143,45,96,27,76,40,81,101,130,91,110,311,49,100
%N a(n) = k such that A083016(k) = prime(n), or -1 if no such k exists.
%C Conjecture: every prime occurs in A083016, so k always exists.
%H Robert Israel, <a href="/A330277/b330277.txt">Table of n, a(n) for n = 1..10000</a>
%e a(3) = 7 because A083016(7) = 5 = prime(3).
%p # using program in A083016 to produce A[1]...A[m]
%p for i from 1 to m do B[A[i]]:= i od:
%p seq(B[ithprime(i)], i=1..numtheory:-pi(A[m]));
%Y Cf. A083016.
%K nonn
%O 1,2
%A _Robert Israel_, Dec 08 2019