Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050621
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050621 Smallest n-digit number divisible by 2^n. +0
24
2, 12, 104, 1008, 10016, 100032, 1000064, 10000128, 100000256, 1000000512, 10000001024, 100000002048, 1000000004096, 10000000008192, 100000000016384, 1000000000032768, 10000000000065536, 100000000000131072 (list; graph; listen)
OFFSET

1,1

COMMENT

Quotients arising from this sequence give A034478 ((5^(n-1)+1)/2).

FORMULA

10^(n-1) + 2^(n-1).

CROSSREFS

Cf. A035014, A034478, A050622.

Sequence in context: A113557 A123897 A052693 this_sequence A152254 A157328 A061632

Adjacent sequences: A050618 A050619 A050620 this_sequence A050622 A050623 A050624

KEYWORD

nonn,base

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1999.

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research