Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056766
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056766 Smallest member of A056757 (numbers for which cube of number of divisors exceeds the number) between 2^(n-1) and 2^n. +0
1
2, 3, 5, 9, 18, 33, 66, 130, 258, 516, 1026, 2052, 4100, 8200, 16400, 32800, 65550, 131100, 262200, 524400, 1048800, 2097600, 4195200, 8390400, 16783200, 33566400, 67132800, 134265600, 268606800, 537213600, 1074427200, 2148854400 (list; graph; listen)
OFFSET

1,1

FORMULA

Smallest x so that 2^(n-1)<x<=2^n and also d[x]^3>x, d[]=A000005.

EXAMPLE

n=7, 64< a(7)=66 <128, d(66)=8, d^3=512>66 and no more such number occurs between 64 and 66. n=31, a(31)=1074427200, 2^30<a(31)<2^31; it has 1344 divisors of which the cube 2427715584>1074427200. Between 2^30 and a(31) no more terms occur with similar property.

CROSSREFS

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

Adjacent sequences: A056763 A056764 A056765 this_sequence A056767 A056768 A056769

Sequence in context: A119002 A047021 A047031 this_sequence A080091 A000602 A034790

KEYWORD

fini,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 16 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research