A322614 Smallest k such that A305445(k) = n, i.e., smallest k > 1 such that the minimum number of bit inversions required to convert k into a prime equals n.

2, 4, 8, 84, 45812984490

Offset

0,1

Comments

Does a(n) exist for every n?

Links

Table of n, a(n) for n=0..4.

Prog

(PARI) a305445(n) = my(b, L, N, s, v); if(n < 2, , if(isprime(n), 0, b = binary(n); L = #b; for(j = 1, L, v = vector(j, Y, [1, L]); forvec(X = v, N = n + sum(k = 1, j, if(b[X[k]], s = -1, s = 1); s*2^(L - X[k])); if(isprime(N), return(j)), 2)))) \\ after Rick L. Shepherd in A305445
a(n) = for(k=2, oo, if(a305445(k)==n, return(k)))

Crossrefs

Cf. A305445.

Sequence in context: A087375 A018580 A267457 * A089337 A088114 A348050

Adjacent sequences: A322611 A322612 A322613 * A322615 A322616 A322617

Keyword

nonn,base,more

Author

Felix Fröhlich, Dec 20 2018

Extensions

a(4) from Giovanni Resta, Jan 03 2019

Status

approved