A056762 Number of terms in A056761 (i.e., odd numbers from A056757) between 2^(n-1) and 2^n.

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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset

1,3

Comments

A056761 is finite and has 267 terms.

Links

Table of n, a(n) for n=1..83.

Formula

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.

Example

The last 4 terms arise between 524288 and 1048576: {675675, 765765, 855855, 883575}, thus here a(20)=4. For n > 20, a(n)=0.

Crossrefs

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

Sequence in context: A210190 A070267 A205374 * A213329 A069830 A153935

Adjacent sequences: A056759 A056760 A056761 * A056763 A056764 A056765

Keyword

nonn

Author

Labos Elemer, Aug 16 2000

Extensions

More terms from Sean A. Irvine, May 05 2022

Status

approved