Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062153
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062153 Floor [ log_3(n) ]. +0
9
0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; listen)
OFFSET

1,9

FORMULA

a(n) = (number of digits of n when written in base 3)-1.

a(n) = if n > 2 then a(floor(n / 3)) + 1 else 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 29 2001

PROGRAM

(MAGMA) [ Ilog(3, n) : n in [1..100] ]; (njas, Dec 23 2006)

CROSSREFS

Cf. A000244, A000523, A007089, A102572.

Sequence in context: A111896 A105515 A105514 this_sequence A135661 A082998 A076620

Adjacent sequences: A062150 A062151 A062152 this_sequence A062154 A062155 A062156

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 06 2001

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research