|
| |
|
|
A126168
|
|
Sum of the proper infinitary divisors of n.
|
|
18
| |
|
|
0, 1, 1, 1, 1, 6, 1, 7, 1, 8, 1, 8, 1, 10, 9, 1, 1, 12, 1, 10, 11, 14, 1, 36, 1, 16, 13, 12, 1, 42, 1, 19, 15, 20, 13, 14, 1, 22, 17, 50, 1, 54, 1, 16, 15, 26, 1, 20, 1, 28, 21, 18, 1, 66, 17, 64, 23, 32, 1, 60, 1, 34, 17, 21, 19, 78, 1, 22, 27, 74, 1, 78, 1, 40, 29
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| A divisor of n is called infinitary if it is a product of divisors of the form p^{y_a 2^a}, where p^y is a prime power dividing n and sum_a y_a 2^a is the binary representation of y.
|
|
|
LINKS
| Wesstein, E, Infinitary Divisor. definition.
|
|
|
FORMULA
| a(n)=isigma(n)-n = A049417(n)-n
|
|
|
EXAMPLE
| As the infinitary divisors of 240 are 1,3,5,15,16,48,80,240, we have a(240)=1+3+5+15+16+48+80=168
|
|
|
MATHEMATICA
| ExponentList[n_Integer, factors_List] := {#, IntegerExponent[n, # ]} & /@ factors; InfinitaryDivisors[1] := {1}; InfinitaryDivisors[n_Integer?Positive] := Module[ { factors = First /@ FactorInteger[n], d = Divisors[n] }, d[[Flatten[Position[ Transpose[ Thread[Function[{f, g}, BitOr[f, g] == g][ #, Last[ # ]]] & /@ Transpose[Last /@ ExponentList[ #, factors] & /@ d]], _?( And @@ # &), {1}]] ]] ] Null; properinfinitarydivisorsum[k_] := Plus @@ InfinitaryDivisors[k] - k; properinfinitarydivisorsum /@ Range[75]
|
|
|
CROSSREFS
| Cf. A049417, A037445.
Sequence in context: A127778 A076714 A113811 * A028323 A137235 A021166
Adjacent sequences: A126165 A126166 A126167 * A126169 A126170 A126171
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Ant King (mathstutoring(AT)ntlworld.com), Dec 21 2006
|
| |
|
|
