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 A327937 #10 Nov 07 2022 07:40:22
%S A327937 1,2,3,2,5,6,7,2,9,10,11,6,13,14,15,2,17,18,19,10,21,22,23,6,25,26,9,
%T A327937 14,29,30,31,2,33,34,35,18,37,38,39,10,41,42,43,22,45,46,47,6,49,50,
%U A327937 51,26,53,18,55,14,57,58,59,30,61,62,63,2,65,66,67,34,69,70,71,18,73,74,75,38,77,78,79,10,9,82,83,42,85,86,87,22
%N A327937 Multiplicative with a(p^e) = p^(p-1) if e >= p, otherwise a(p^e) = p^e.
%C A327937 All terms are in A048103.
%H A327937 Antti Karttunen, <a href="/A327937/b327937.txt">Table of n, a(n) for n = 1..20000</a>
%F A327937 Multiplicative with a(p^e) = p^(p-1) if e >= p, otherwise a(p^e) = p^e.
%F A327937 For all n, A129251(a(n)) = 0, A327936(a(n)) = 1.
%F A327937 Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p prime} (1 - 1/((p+1)*p^(p-1))) = 0.40498413761092854213... . - _Amiram Eldar_, Nov 07 2022
%t A327937 f[p_, e_] := If[e >= p, p^(p - 1), p^e]; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Nov 07 2022 *)
%o A327937 (PARI) A327937(n) = { my(f = factor(n)); for(k=1, #f~, if(f[k,2]>=f[k,1], f[k,2] = f[k,1]-1)); factorback(f); };
%Y A327937 Cf. A048103, A129251, A327936, A327938.
%K A327937 nonn,mult
%O A327937 1,2
%A A327937 _Antti Karttunen_, Oct 01 2019