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.

A340678 a(n) = A008472(n) / gcd(A007947(n), A008472(n)).

This page as a plain text file.
%I A340678 #9 Feb 01 2021 19:41:08
%S A340678 0,1,1,1,1,5,1,1,1,7,1,5,1,9,8,1,1,5,1,7,10,13,1,5,1,15,1,9,1,1,1,1,
%T A340678 14,19,12,5,1,21,16,7,1,2,1,13,8,25,1,5,1,7,20,15,1,5,16,9,22,31,1,1,
%U A340678 1,33,10,1,18,8,1,19,26,1,1,5,1,39,8,21,18,3,1,7,1,43,1,2,22,45,32,13,1,1,20,25,34,49,24,5,1,9
%N A340678 a(n) = A008472(n) / gcd(A007947(n), A008472(n)).
%H A340678 Antti Karttunen, <a href="/A340678/b340678.txt">Table of n, a(n) for n = 1..16384</a>
%H A340678 Antti Karttunen, <a href="/A340678/a340678.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A340678 a(n) = A008472(n) / A099636(n) = A008472(n) / gcd(A007947(n), A008472(n)).
%o A340678 (PARI)
%o A340678 A007947(n) = factorback(factorint(n)[, 1]);
%o A340678 A008472(n) = vecsum(factor(n)[, 1]);
%o A340678 A340678(n) = { my(v=A008472(n)); (v/gcd(A007947(n), v)); };
%Y A340678 Cf. A007947, A008472, A099636, A340677.
%Y A340678 Cf. also A082343.
%K A340678 nonn
%O A340678 1,6
%A A340678 _Antti Karttunen_, Feb 01 2021