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.
%I A056762 #12 May 05 2022 22:55:35
%S A056762 0,1,2,2,3,8,5,12,19,13,25,31,22,33,28,17,24,12,6,4,0,0,0,0,0,0,0,0,0,
%T A056762 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A056762 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A056762 Number of terms in A056761 (i.e., odd numbers from A056757) between 2^(n-1) and 2^n.
%C A056762 A056761 is finite and has 267 terms.
%F A056762 Occurrences of odd integers x such that 2^(n-1) < x <= 2^n and the cube of number of divisors is larger than the number: A000005(x)^3 > x.
%e A056762 The last 4 terms arise between 524288 and 1048576: {675675, 765765, 855855, 883575}, thus here a(20)=4. For n > 20, a(n)=0.
%Y A056762 Cf. A000005, A029837, A035033-A035035, A034884, A056757-A056767.
%K A056762 nonn
%O A056762 1,3
%A A056762 _Labos Elemer_, Aug 16 2000
%E A056762 More terms from _Sean A. Irvine_, May 05 2022