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!)
A071166 a(n) = n - A006530(A000203(n)), difference between n and largest prime factor of the sum of its divisors. 2
-1, 1, -3, 2, 3, 5, 3, -4, 7, 8, 5, 6, 11, 12, -15, 14, 5, 14, 13, 19, 19, 20, 19, -6, 19, 22, 21, 24, 27, 29, 25, 30, 31, 32, 23, 18, 33, 32, 35, 34, 39, 32, 37, 32, 43, 44, 17, 30, 19, 48, 45, 50, 49, 52, 51, 52, 53, 54, 53, 30, 59, 50, -63, 58, 63, 50, 61, 66, 67, 68, 59, 36, 55, 44, 69, 74, 71, 74, 49, 70, 75, 76, 77, 82, 75, 82, 83 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,3
COMMENTS
Terms are mostly positive. At cases when sigma(n) is prime the differences are negative. See A071167.
LINKS
EXAMPLE
n=12, divisors={1,2,3,4,6,12}, sigma(12)=28, its largest prime factor is 7, so a(12)=12-7=5.
MAPLE
gpf:= n -> max(numtheory:-factorset(n)):
seq(n - gpf(numtheory:-sigma(n)), n=2..100); # Robert Israel, Feb 12 2017
MATHEMATICA
ma[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] t=Table[w-ma[DivisorSigma[1, w]], {w, 2, 128}]
PROG
(PARI) a(n)=n-factor(sigma(n))[1, 1] \\ Charles R Greathouse IV, Feb 19 2013
CROSSREFS
Sequence in context: A098229 A346388 A128151 * A140358 A130727 A155515
KEYWORD
sign
AUTHOR
Labos Elemer, May 15 2002
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 7 14:24 EDT 2024. Contains 375013 sequences. (Running on oeis4.)