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 A295657 #20 Nov 30 2022 08:35:41
%S A295657 1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,3,1,1,1,1,4,1,1,
%T A295657 1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,3,1,2,1,1,1,1,1,1,1,4,1,1,1,1,
%U A295657 1,1,1,2,1,1,1,1,1,1,1,2,3,1,1,1,1,1,1,2,1,1,1,1,1,1,1,4,1,1,1,1,1,1,1,2,1
%N A295657 Multiplicative with a(p^e) = p^floor((e-1)/2).
%H A295657 Antti Karttunen, <a href="/A295657/b295657.txt">Table of n, a(n) for n = 1..20000</a>
%F A295657 a(1) = 1; for n > 1, a(n) = A020639(n)^A004526(A067029(n)-1) * a(A028234(n)).
%F A295657 a(n) = A000188(A003557(n)).
%F A295657 a(n) = 1 iff A212793(n) = 1.
%F A295657 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 15/Pi^2 = 1.519817... (A082020). - _Amiram Eldar_, Nov 30 2022
%t A295657 Array[Apply[Times, FactorInteger[#] /. {p_, e_} /; p > 0 :> p^Floor[(e - 1)/2]] &, 105] (* _Michael De Vlieger_, Nov 28 2017 *)
%o A295657 (Scheme, with memoization-macro definec) (definec (A295657 n) (if (= 1 n) 1 (* (expt (A020639 n) (A004526 (- (A067029 n) 1))) (A295657 (A028234 n)))))
%o A295657 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i,1]^floor((f[i,2]-1)/2));} \\ _Amiram Eldar_, Nov 30 2022
%Y A295657 Cf. A000188, A003557, A004526, A020639, A028234, A067029, A295658, A295659.
%Y A295657 Cf. A004709 (positions of ones), A082020, A212793.
%Y A295657 Cf. also A008834, A053150, A061704.
%K A295657 nonn,mult
%O A295657 1,8
%A A295657 _Antti Karttunen_, Nov 28 2017