Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056767
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056767 Largest number of binary size n (i.e. between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself. +0
7
2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2046, 4095, 8190, 16380, 32760, 65520, 131040, 262080, 524160, 1048320, 2097144, 4193280, 8386560, 16773900, 33547800, 67095600, 134191200, 268382400, 536215680, 1073709000, 2144142000 (list; graph; listen)
OFFSET

1,1

FORMULA

Largest terms of A056757 between 2^(n-1) and 2^n.

EXAMPLE

These maximal terms are usually "near" to 2^n, for n=1-10 are equal to 2^n. At n=21, a(21)=2097144, 1048576<a(21)<2097144=8*27*7*19*73 has 128 divisors, of which the cube is ddd=2097152. So this maximum is near but still below d^3.

CROSSREFS

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

Sequence in context: A145116 A122265 A113010 this_sequence A008863 A145117 A133025

Adjacent sequences: A056764 A056765 A056766 this_sequence A056768 A056769 A056770

KEYWORD

fini,nonn

AUTHOR

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

page 1

Search completed in 0.006 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research