Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056576
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056576 Highest k with 2^k<=3^n. +0
4
0, 1, 3, 4, 6, 7, 9, 11, 12, 14, 15, 17, 19, 20, 22, 23, 25, 26, 28, 30, 31, 33, 34, 36, 38, 39, 41, 42, 44, 45, 47, 49, 50, 52, 53, 55, 57, 58, 60, 61, 63, 64, 66, 68, 69, 71, 72, 74, 76, 77, 79, 80, 82, 84, 85, 87, 88, 90, 91, 93, 95, 96, 98, 99, 101, 103, 104, 106, 107 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = floor[log2(3^n)] =log2(A000244(n)-A056576(n)) =a(n-1)+A022921(n-1)

EXAMPLE

a(3)=4 because 3^3=27 and 2^4=16 is power of 2 immediately below 27

MATHEMATICA

Table[ Floor[Log[2, 3^n]], {n, 0, 69}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Apr 06 2006) - Henry Bottomley (se16(AT)btinternet.com), Jun 29 2000

CROSSREFS

Cf. A056850.

Adjacent sequences: A056573 A056574 A056575 this_sequence A056577 A056578 A056579

Sequence in context: A018825 A059555 A054385 this_sequence A059552 A047516 A006855

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 29 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 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research