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 A340677 #13 Feb 03 2021 23:39:28
%S A340677 1,1,1,1,1,6,1,1,1,10,1,6,1,14,15,1,1,6,1,10,21,22,1,6,1,26,1,14,1,3,
%T A340677 1,1,33,34,35,6,1,38,39,10,1,7,1,22,15,46,1,6,1,10,51,26,1,6,55,14,57,
%U A340677 58,1,3,1,62,21,1,65,33,1,34,69,5,1,6,1,74,15,38,77,13,1,10,1,82,1,7,85,86,87,22,1,3,91,46,93
%N A340677 a(n) = A007947(n) / gcd(A007947(n), A008472(n)).
%H A340677 Antti Karttunen, <a href="/A340677/b340677.txt">Table of n, a(n) for n = 1..16384</a>
%H A340677 Antti Karttunen, <a href="/A340677/a340677.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A340677 a(n) = A007947(n) / A099636(n) = A007947(n) / gcd(A007947(n), A008472(n)).
%F A340677 a(n) = 1 iff n is power of prime (A000961). - _Bernard Schott_, Feb 01 2021
%F A340677 a(A006881(n)) = A006881(n). - _Bernard Schott_ and _Antti Karttunen_, Feb 01 2021
%o A340677 (PARI)
%o A340677 A007947(n) = factorback(factorint(n)[, 1]);
%o A340677 A008472(n) = vecsum(factor(n)[, 1]);
%o A340677 A340677(n) = { my(u=A007947(n)); (u/gcd(u, A008472(n))); };
%Y A340677 Cf. A000961 (positions of ones), A006881, A007947, A008472, A099636, A340678.
%Y A340677 Cf. also A082344.
%K A340677 nonn
%O A340677 1,6
%A A340677 _Antti Karttunen_, Feb 01 2021