OFFSET
1,3
COMMENTS
Each n > 1 occurs exactly twice in this sequence. a(n) tells which number is located at the parent node of the node that contains n in the binary tree A285332. See further comments there.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..4096
MATHEMATICA
Table[Which[n == 1, 0, MoebiusMu@ n != 0, Total@ Map[#2*2^(PrimePi@ #1 - 1) & @@ # &, FactorInteger[n]], True, With[{r = DivisorSum[n, EulerPhi[#] Abs@ MoebiusMu[#] &]}, SelectFirst[Range[n - 2, 2, -1], DivisorSum[#, EulerPhi[#] Abs@ MoebiusMu[#] &] == r &]]], {n, 81}] (* Michael De Vlieger, Dec 31 2018 *)
PROG
(PARI)
A007947(n) = factorback(factorint(n)[, 1]); \\ From Andrew Lelechenko, May 09 2014
A048675(n) = my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; \\ Michel Marcus, Oct 10 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 19 2017
STATUS
approved