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!)
A056767 Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself. 7

%I #13 Jan 01 2017 02:03:18

%S 2,4,8,16,32,64,128,256,512,1024,2046,4095,8190,16380,32760,65520,

%T 131040,262080,524160,1048320,2097144,4193280,8386560,16773900,

%U 33547800,67095600,134191200,268382400,536215680,1073709000,2144142000,4288284000

%N Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.

%F Largest terms of A056757 between 2^(n-1) and 2^n.

%e These maximal terms are usually "near" to 2^n. For n=1..10 they are equal to 2^n. At n=21, a(21)=2097144, 1048576 < a(21) < 2097144 = 8*27*7*19*73 has d=128 divisors, of which the cube is d^3d=2097152. So this maximum is near to but still less than d^3.

%t Table[Last@ Select[Range @@ (2^{n - 1, n}), DivisorSigma[0, #]^3 > # &], {n, 22}] (* _Michael De Vlieger_, Dec 31 2016 *)

%o (PARI) a(n) = {k = 2^n; while(numdiv(k)^3 <= k, k--); k;} \\ _Michel Marcus_, Dec 11 2013

%Y Cf. A000005, A029837, A035033-A035035, A034884, A056757-A056767, A056781.

%K fini,nonn

%O 1,1

%A _Labos Elemer_, Aug 16 2000

%E a(32) from _Michel Marcus_, Dec 11 2013

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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)