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!)
A322446 The number of solutions to usigma(k) > esigma(k) below 10^n, where usigma(k) is the sum of unitary divisors of k (A034448) and esigma(k) is the sum of exponential divisors of k (A051377). 0
5, 74, 776, 7770, 77794, 778337, 7784712, 77833385, 778307928, 7783494530 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The value of the asymptotic density of these solutions was asked in the paper by Trudgian.
LINKS
Tim Trudgian, The sum of the unitary divisor function, Publications de l'Institut Mathématique (Beograd), Vol. 97, No. 111 (2015), pp. 175-180.
FORMULA
Lim_{n->oo} a(n)/10^n = 0.778...
EXAMPLE
Below 10^1 there are 5 numbers k with usigma(k) > esigma(k): 2, 3, 5, 6, and 7. Thus a(1) = 5.
MATHEMATICA
aQ[1] = False; fun[p_, e_] := DivisorSum[e, p^# &]; aQ[n_] := Times @@ (1 + Power @@@ (f = FactorInteger[n])) > Times @@ (fun @@@ f); c = 0; k = 1; s = {}; Do[While[k < 10^n, If[aQ[k], c++]; k++]; AppendTo[s, c], {n, 1, 6}]; s
CROSSREFS
Sequence in context: A051156 A092826 A334258 * A065894 A233013 A370463
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, Aug 28 2019
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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)