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 A348496 #14 Feb 02 2022 20:36:28 %S A348496 1,1,1,1,1,5,1,1,1,1,1,4,1,3,1,2,1,21,1,36,5,1,1,1,1,15,3,4,1,1,1,1,7, %T A348496 1,3,1,1,3,1,1,1,1,1,12,3,5,1,10,1,3,5,4,1,9,1,1,1,1,1,12,1,3,1,1,9,1, %U A348496 1,12,1,1,1,1,1,3,1,4,3,1,1,2,1,1,1,4,11,15,1,35,1,3,5,36,1,1,3,1,1,3,3,1,1 %N A348496 a(n) = gcd(A018804(n), A347130(n)) / A003557(n). %H A348496 Antti Karttunen, <a href="/A348496/b348496.txt">Table of n, a(n) for n = 1..20000</a> %F A348496 a(n) = A348495(n) / A003557(n). %F A348496 a(n) = gcd(A347128(n), A347129(n)). %t A348496 Table[GCD[Total@ GCD[n, Range[n]], DivisorSum[n, #*(If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &[n/#]) &]]/Apply[Times, Map[#1^(#2 - 1) & @@ # &, FactorInteger[n]]], {n, 101}] (* _Michael De Vlieger_, Oct 21 2021 *) %o A348496 (PARI) %o A348496 \\ Needs also code from A348495: %o A348496 A003557(n) = (n/factorback(factorint(n)[, 1])); %o A348496 A348496(n) = (A348495(n)/A003557(n)); %Y A348496 Cf. A003557, A018804, A347128, A347129, A347130, A348495, A348501 [= a(A276086(n))]. %Y A348496 Cf. also A348494, A348498. %K A348496 nonn %O A348496 1,6 %A A348496 _Antti Karttunen_, Oct 21 2021