

A247233


Smallest m such that A075323(m) = nth odd prime, or zero, if no such m exists.


2



1, 2, 3, 4, 5, 11, 6, 7, 12, 8, 9, 29, 15, 10, 13, 16, 17, 14, 30, 23, 18, 19, 509, 24, 25, 20, 55, 21, 37, 26, 22, 35, 27, 31, 38, 33, 56, 28, 36, 43, 32, 34, 39, 41, 51, 45, 44, 53, 47, 40, 42, 65, 52, 46, 49, 67, 161, 48, 54, 63, 59, 66, 61, 50, 79, 57
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Conjecture: a(388) = 0, i.e., A065091(388) = 2683 doesn't occur in A075323;
for n with a(n) > 0: A075323(a(n)) = A065091(n) = A000040(n+1).


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..387


EXAMPLE

Also a(389) = 0 (presumably), whereas subsequent terms (n > 389) are > 0:
393,443,421,350,397,455,368,433,387,352,356,382,384,366,372,392,374, ...
with corresponding odd primes:
2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777, ...


MATHEMATICA

maxm = 3000;
A075321p[n_] := A075321p[n] = Module[{prevlist, i, p, q}, If[n == 1, Return[{3, 5}], prevlist = Array[A075321p, n1] // Flatten]; For[i = 2, True, i++, p = Prime[i]; If[FreeQ[prevlist, p], q = p + 2*n; If[ PrimeQ[q] && FreeQ[prevlist, q], Return[{p, q}]]]]];
A075323[n_] := If[OddQ[n], A075321p[(n + 1)/2][[1]], A075321p[n/2][[2]]];
a[n_] := For[m = 1, m <= maxm, m++, If[A075323[m] == Prime[n + 1], Return[m]]] /. Null > 0;
Array[a, 387] (* JeanFrançois Alcover, Feb 12 2018, after R. J. Mathar's program for A075321p *)


PROG

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a247233 = (+ 1) . fromJust . (`elemIndex` a075323_list) . a065091


CROSSREFS

Cf. A075323, A065091, A000040.
Sequence in context: A111665 A111666 A080475 * A329906 A325651 A345451
Adjacent sequences: A247230 A247231 A247232 * A247234 A247235 A247236


KEYWORD

nonn


AUTHOR

Reinhard Zumkeller, Nov 29 2014


STATUS

approved



