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 A347123 #13 Apr 05 2022 17:07:43
%S A347123 1,2,3,4,3,6,5,8,9,6,3,12,5,10,9,16,3,18,5,12,15,6,7,24,9,10,27,20,3,
%T A347123 18,7,32,9,6,15,36,5,10,15,24,3,30,5,12,27,14,7,48,25,18,9,20,7,54,9,
%U A347123 40,15,6,3,36,7,14,45,64,15,18,5,12,21,30,3,72,7,10,27,20,15,30,5,48,81,6,7,60,9,10,9,24,11,54
%N A347123 Fully multiplicative with a(prime(k)) = prime(1+floor(A001223(k)/2)).
%H A347123 Antti Karttunen, <a href="/A347123/b347123.txt">Table of n, a(n) for n = 1..16384</a>
%H A347123 Antti Karttunen, <a href="/A347123/a347123.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A347123 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>
%F A347123 For all n >= 1, A001222(a(n)) = A001222(n), A007814(a(n)) = A007814(n).
%F A347123 For all n >= 1, a(A003586(n)) = A003586(n).
%o A347123 (PARI) A347123(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 1] = prime(1+((nextprime(f[i, 1]+1)-f[i,1])\2))); factorback(f); };
%Y A347123 Cf. A001222, A001223, A003586, A007814, A347101, A347102.
%Y A347123 Cf. also A336855.
%K A347123 nonn,mult,look
%O A347123 1,2
%A A347123 _Antti Karttunen_, Aug 19 2021