cp's OEIS Frontend

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.

A318459 a(n) = gcd(n, tau(n), phi(n)), where tau = A000005 and phi = A000010.

This page as a plain text file.
%I A318459 #9 Jul 30 2019 19:53:12
%S A318459 1,1,1,1,1,2,1,4,3,2,1,2,1,2,1,1,1,6,1,2,1,2,1,8,1,2,1,2,1,2,1,2,1,2,
%T A318459 1,3,1,2,1,8,1,2,1,2,3,2,1,2,1,2,1,2,1,2,1,8,1,2,1,4,1,2,3,1,1,2,1,2,
%U A318459 1,2,1,12,1,2,1,2,1,2,1,2,1,2,1,12,1,2,1,8,1,6,1,2,1,2,1,4,1,2,3,1,1,2,1,8,1
%N A318459 a(n) = gcd(n, tau(n), phi(n)), where tau = A000005 and phi = A000010.
%H A318459 Antti Karttunen, <a href="/A318459/b318459.txt">Table of n, a(n) for n = 1..65537</a>
%F A318459 a(n) = gcd(n, A000005(n), A000010(n)).
%F A318459 a(n) = gcd(n,A009213(n)) = gcd(A000005(n),A009195(n)) = gcd(A000010(n),A009191(n)).
%t A318459 Table[GCD[n,DivisorSigma[0,n],EulerPhi[n]],{n,110}] (* _Harvey P. Dale_, Jul 30 2019 *)
%o A318459 (PARI) A318459(n) = gcd([n, numdiv(n), eulerphi(n)]);
%Y A318459 Cf. A000005, A000010, A009191, A009195, A009213.
%Y A318459 Cf. also A074389.
%K A318459 nonn
%O A318459 1,6
%A A318459 _Antti Karttunen_, Sep 07 2018, after _Labos Elemer_'s A074389