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!)
A348426 Numbers k for which sigma(k) = k + k'', where k'' is the second derivative of k (A068346). 0
1, 161, 209, 221, 4265, 12690, 15941, 22217, 24041, 25637, 30377, 38117, 39077, 48617, 49097, 55877, 68441, 73817, 76457, 80357, 88457, 95237, 98117, 99941, 105641, 110057, 115397, 122537, 130217, 131141, 136517, 143237, 147941, 148697, 152357, 154457, 159077 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If p and q are different prime numbers and p + q is in A007850 (Giuga numbers) then m = p*q is a term because sigma(m) = sigma(p*q) = p*q + p + q + 1 and m + m'' = p*q + (p + q)' = p*q + p + q + 1 and sigma(m) = m + m''.
LINKS
EXAMPLE
sigma(1) = 1 and 1 + 1'' = 1 so 1 is a term.
sigma(161) = 1 + 7 + 23 + 161 = 192 and 161 + 161'' = 161 + 30' = 161 + 31 = 192 so 161 is a term.
sigma(12690) = sigma(2*3^3*5*47) = 34560 and 12690 + 12690'' = 12690 + A068346(12690) = 12690 + 21870 = 34560 so 12690 is a term.
MATHEMATICA
d[0] = d[1] = 0; d[n_] := n * Plus @@ ((Last[#]/First[#]) & /@ FactorInteger[n]); Select[Range[160000], DivisorSigma[1, #] == # + d[d[#]] &] (* Amiram Eldar, Oct 18 2021 *)
PROG
(Magma) f:=func<n|n le 1 select 0 else n*(&+[Factorisation(n)[i][2] / Factorisation(n)[i][1]: i in [1..#Factorisation(n)]])>; [n:n in [1..160000]| DivisorSigma(1, n) eq n+Floor(f(Floor(f(n))))];
(PARI) ad(n) = vecsum([n/f[1]*f[2]|f<-factor(n+!n)~]); \\ A003415
isok(k) = sigma(k) == k+ad(ad(k)); \\ Michel Marcus, Oct 18 2021
CROSSREFS
Sequence in context: A025342 A371338 A189639 * A298615 A250644 A060641
KEYWORD
nonn
AUTHOR
Marius A. Burtea, Oct 18 2021
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 17 15:32 EDT 2024. Contains 375227 sequences. (Running on oeis4.)