[go: up one dir, main page]

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!)
A324185 Deficiency of n permuted by A163511: a(n) = A033879(A163511(n)) = 2*A163511(n) - sigma(A163511(n)). 10
1, 1, 1, 2, 1, 5, 0, 4, 1, 14, -3, 19, -4, 6, 2, 6, 1, 41, -12, 94, -19, 26, 7, 41, -12, 12, -12, 22, -2, 10, 4, 10, 1, 122, -39, 469, -64, 126, 32, 286, -51, 47, -72, 148, -17, 66, 25, 109, -28, 30, -54, 102, -48, 18, -4, 58, -10, 22, -12, 38, 0, 18, 8, 12, 1, 365, -120, 2344, -199, 626, 157, 2001, -168, 222, -372, 1030, -92, 458, 172, 1198 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
If there are no odd perfect numbers, then all n for which a(n) is 0 are given by sequence A324200.
LINKS
FORMULA
a(n) = A033879(A163511(n)) = 2*A163511(n) - A324184(n) = 2*A163511(n) - A000203(A163511(n)).
For n > 0, a(n) = A324055(A054429(n)).
PROG
(PARI)
A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
A033879(n) = (2*n-sigma(n));
(PARI)
A324184(n) = if(!n, 1, my(p=2, mp=p*p, m=1); while(n>1, if(n%2, p=nextprime(1+p); mp = p*p, if((2==n)||!(n%4), mp *= p, m *= (mp-1)/(p-1))); n >>= 1); (m*(mp-1)/(p-1)));
A324185(n) = (2*A163511(n)) - A324184(n);
CROSSREFS
Sequence in context: A127477 A104505 A359479 * A348175 A175958 A021469
KEYWORD
sign,look
AUTHOR
Antti Karttunen, Feb 17 2019
STATUS
approved

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 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)