This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322614 #11 Jan 04 2019 03:26:19 %S A322614 2,4,8,84,45812984490 %N 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. %C A322614 Does a(n) exist for every n? %o A322614 (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 %o A322614 a(n) = for(k=2, oo, if(a305445(k)==n, return(k))) %Y A322614 Cf. A305445. %K A322614 nonn,base,more %O A322614 0,1 %A A322614 _Felix Fröhlich_, Dec 20 2018 %E A322614 a(4) from _Giovanni Resta_, Jan 03 2019