A056764 Number of integers k not exceeding 2^n such that the cube of number of divisors [A000005(k)] is larger than k.

1, 3, 7, 13, 24, 48, 78, 138, 248, 385, 633, 1032, 1523, 2324, 3470, 4856, 6844, 9369, 12283, 15920, 20001, 24335, 28984, 33563, 37868, 41735, 44946, 47413, 49143, 50262, 50854, 51126, 51230, 51258, 51261, 51261, 51261, 51261, 51261, 51261, 51261, 51261, 51261

Offset: 1

Author

Labos Elemer, Aug 16 2000

Keywords

• nonn
• easy

Comments

a(n) = 51261 for n >= 35 since A056757 is finite with 51261 terms. - Amiram Eldar, Jun 02 2024

Examples

			Below 2^29 = 536870912 in A056757 altogether 49143 terms occur, so a(29) = 49143.
		

Links

• Index entries for linear recurrences with constant coefficients, signature (1).

Crossrefs

Number of entries in A056757 not exceeding 2^n.

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

Programs

Mathematica

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 *)

Extensions

More terms from Amiram Eldar, Jun 02 2024