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!)
A338891 a(n) is the least number k such that the average number of odd divisors of {1..k} is >= n. 5
1, 21, 165, 1274, 9435, 69720, 515230, 3807265, 28132035, 207869515, 1535959665, 11349295155 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..12.

Eric Weisstein's World of Mathematics, Odd Divisor Function.

FORMULA

a(n+1)/a(n) approaches e^2.

EXAMPLE

a(5) = 9435 because the average number of odd divisors of {1..9435} is >= 5.

MATHEMATICA

m = 1; sum = 0; s = {}; Do[sum += DivisorSigma[0, k/2^IntegerExponent[k, 2]]; If[sum >= m*k, AppendTo[s, k]; m++], {k, 1, 10^6}]; s (* Amiram Eldar, Nov 15 2020 *)

PROG

(PARI) a(n) = my(s=1, k=1); while(s<k*n, k++; s=s+numdiv(k>>valuation(k, 2))); k; \\ Michel Marcus, Nov 14 2020

CROSSREFS

Cf. A001227, A060831, A072334, A085829, A328331, A338943.

Sequence in context: A070315 A242191 A146301 * A126993 A332944 A022681

Adjacent sequences:  A338888 A338889 A338890 * A338892 A338893 A338894

KEYWORD

nonn,more

AUTHOR

Ilya Gutkovskiy, Nov 14 2020

EXTENSIONS

a(11)-a(12) from Amiram Eldar, Nov 16 2020

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 October 4 03:29 EDT 2022. Contains 357237 sequences. (Running on oeis4.)