login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A023899
Integer values of divisor balance: Sum_{d divides k} {d / phi(d)} for numbers k in A023898.
4
1, 3, 5, 7, 4, 9, 12, 11, 20, 9, 13, 28, 7, 27, 10, 26, 15, 36, 21, 45, 14, 25, 17, 44, 25, 35, 63, 8, 42, 42, 16, 19, 7, 52, 6, 49, 81, 24, 10, 30, 40, 70, 78, 21, 21, 19, 60, 18, 63, 99, 40, 30, 98, 7, 18, 75, 15, 23, 57, 35, 30, 57, 68, 75, 36, 35, 30, 77, 55, 74, 91, 117
OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Vincenzo Librandi)
FORMULA
Divisor balance of n = Sum_{d divides n} {d / phi(d)} where phi is Euler's phi function.
EXAMPLE
a(9) = 20 because the 9th integer having an integer divisor balance is 36 : its divisors are 1,2,3,4,6,9,12,18 and 36, giving the fractions (1, 2, 3/2, 2, 3, 3/2, 3, 3, 3) which sum to 20.
MATHEMATICA
Select[ Array[ Function[ n, Plus @@ Map[ #/EulerPhi[ # ]&, Divisors[ n ] ] ], 3000 ], IntegerQ ]
s[n_] := DivisorSum[n, #/EulerPhi[#] &]; Select[s /@ Range[4000], IntegerQ] (* Amiram Eldar, Jul 01 2022 *)
CROSSREFS
cf. A023898 (integers for which the divisor balance is an integer).
cf. A000010, A239886, A239887 for a version with proper divisors.
Sequence in context: A101088 A134487 A064537 * A356026 A356379 A324712
KEYWORD
nonn
STATUS
approved