Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050624
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050624 Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n. +0
2
1, 2, 4, 13, 42, 138, 458, 1525, 5081, 16936, 56451, 188168, 627226, 2090752, 6969172, 23230574, 77435244, 258117480, 860391598, 2867971991, 9559906636, 31866355454, 106221184845, 354070616148, 1180235387158, 3934117957192 (list; graph; listen)
OFFSET

1,2

FORMULA

ceiling(10^(n-1)/3^n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 2003

CROSSREFS

Cf. A050623.

Sequence in context: A118930 A087214 A002771 this_sequence A135501 A001548 A115600

Adjacent sequences: A050621 A050622 A050623 this_sequence A050625 A050626 A050627

KEYWORD

nonn,base

AUTHOR

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

EXTENSIONS

More terms from Erich Friedman (efriedma(AT)stetson.edu), Feb 19 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 December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research