cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A056766 Smallest term of A056757 (numbers for which the cube of the number of divisors exceeds the number) between 2^(n-1) and 2^n.

This page as a plain text file.
%I A056766 #15 Aug 16 2024 08:37:52
%S A056766 2,3,5,9,18,33,66,130,258,516,1026,2052,4100,8200,16400,32800,65550,
%T A056766 131100,262200,524400,1048800,2097600,4195200,8390400,16783200,
%U A056766 33566400,67132800,134265600,268606800,537213600,1074427200,2148854400,4297708800,8627018400,18897278400
%N A056766 Smallest term of A056757 (numbers for which the cube of the number of divisors exceeds the number) between 2^(n-1) and 2^n.
%C A056766 Smallest k so that 2^(n-1) < k <= 2^n and A000005(k)^3 > k.
%e A056766 For n=7, 64 < a(7) = 66 < 128, A000005(66)^3 = 8^3 = 512 > 66, and no other such number occurs between 64 and 66.
%e A056766 For n=31, a(31) = 1074427200, 2^30 < a(31) < 2^31; a(31) has 1344 divisors and 1344^3 = 2427715584 > 1074427200. Between 2^30 and a(31) no other numbers occur with this property.
%Y A056766 Cf. A000005, A035033, A035034, A035035, A034884, A029837, A056757-A056767.
%K A056766 nonn,fini,full
%O A056766 1,1
%A A056766 _Labos Elemer_, Aug 16 2000
%E A056766 a(33)-a(35) from _Amiram Eldar_, Aug 15 2024