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.

A325385 a(n) = gcd(n-A048250(n), n-A162296(n)).

This page as a plain text file.
%I A325385 #6 Apr 24 2019 19:46:03
%S A325385 1,1,1,1,1,6,1,1,5,2,1,4,1,2,3,1,1,3,1,2,1,2,1,12,19,2,1,4,1,6,1,1,3,
%T A325385 2,1,1,1,2,1,2,1,6,1,4,3,2,1,4,41,1,3,2,1,6,1,8,1,2,1,12,1,2,1,1,1,6,
%U A325385 1,2,3,2,1,3,1,2,1,4,1,6,1,2,1,2,1,4,1,2,3,4,1,18,7,4,1,2,5,12,1,1,3,1,1,6,1,2,3
%N A325385 a(n) = gcd(n-A048250(n), n-A162296(n)).
%H A325385 Antti Karttunen, <a href="/A325385/b325385.txt">Table of n, a(n) for n = 1..65537</a>
%F A325385 a(n) = gcd(n-A048250(n), n-A162296(n)).
%F A325385 a(n) = gcd(A325313(n), A325314(n)).
%F A325385 a(A228058(n)) = A325375(n).
%o A325385 (PARI)
%o A325385 A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
%o A325385 A162296(n) = sumdiv(n, d, d*(1-issquarefree(d)));
%o A325385 A325385(n) = gcd(n-A048250(n),n-A162296(n));
%Y A325385 Cf. A048250, A126795, A162296, A228058, A325313, A325314, A325375.
%K A325385 nonn
%O A325385 1,6
%A A325385 _Antti Karttunen_, Apr 24 2019