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 A056764 #15 Jun 02 2024 14:39:30
%S A056764 1,3,7,13,24,48,78,138,248,385,633,1032,1523,2324,3470,4856,6844,9369,
%T A056764 12283,15920,20001,24335,28984,33563,37868,41735,44946,47413,49143,
%U A056764 50262,50854,51126,51230,51258,51261,51261,51261,51261,51261,51261,51261,51261,51261
%N A056764 Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.
%C A056764 a(n) = 51261 for n >= 35 since A056757 is finite with 51261 terms. - _Amiram Eldar_, Jun 02 2024
%H A056764 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%e A056764 Below 2^29 = 536870912 in A056757 altogether 49143 terms occur, so a(29) = 49143.
%t A056764 With[{s = Import["https://oeis.org/A056757/b056757.txt", "Table"][[;; , 2]]}, a[n_] := Count[s, _?(# <= 2^n &)]; Table[a[n], {n, 1, 35}]] (* _Amiram Eldar_, Jun 02 2024 *)
%Y A056764 Number of entries in A056757 not exceeding 2^n.
%Y A056764 Cf. A000005, A029837, A034884, A035033-A035035, A056757-A056767, A056781.
%K A056764 nonn,easy
%O A056764 1,2
%A A056764 _Labos Elemer_, Aug 16 2000
%E A056764 More terms from _Amiram Eldar_, Jun 02 2024