login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325966 a(n) is the largest i <= sigma(n)-A020639(n) such that n-i and n-(sigma(n)-i) are relatively prime. 8

%I #8 Jun 02 2019 00:52:08

%S 0,1,0,5,0,7,0,13,10,15,0,25,0,21,20,29,0,37,0,39,28,33,0,55,26,39,36,

%T 29,0,67,0,61,44,51,42,89,0,57,52,87,0,91,0,81,74,69,0,121,50,91,68,

%U 95,0,115,66,117,76,87,0,163,0,93,100,125,78,139,0,121,92,141,0,193,0,111,120,137,88,163,0,183,118,123,0

%N a(n) is the largest i <= sigma(n)-A020639(n) such that n-i and n-(sigma(n)-i) are relatively prime.

%H Antti Karttunen, <a href="/A325966/b325966.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A325966/a325966.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>

%F a(n) = A000203(n) - A325965(n).

%F For all n:

%F a(A000396(n)) = A000396(n)+1.

%F a(n) <= A325818(n).

%o (PARI)

%o A020639(n) = if(1==n, n, factor(n)[1, 1]);

%o A325966(n) = { my(s=sigma(n)); forstep(i=s-A020639(n), 0, -1, if(1==gcd(n-i, n-(s-i)), return(i))); };

%Y Cf. A000203, A000396, A020639, A324213, A325818, A325961, A325962, A325965.

%K nonn

%O 1,4

%A _Antti Karttunen_, May 29 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 27 01:48 EDT 2024. Contains 375462 sequences. (Running on oeis4.)