login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103354 Floor(x), where x is the solution to x = 2^(n-x). 7
1, 1, 2, 2, 3, 4, 4, 5, 6, 7, 8, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 64, 65, 66, 67 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Partial sums seem to be A006697(n-1) = A094913(n-1)+1. - M. F. Hasler, Dec 14 2007

FORMULA

a(n) is approximately n/(1+log_2(n)/n).

a(n) = [ LambertW(log(2)*2^n)/log(2) ] = [ n - log_2(n) + log_2(n)/(n log(2)) + O((log(n)/n)^2) ] = [ n - log_2(n) + 1.5*log_2(n)/n ] at least for all n<10^7. - M. F. Hasler, Dec 14 2007

MATHEMATICA

a[n_] := Floor[ FullSimplify[ ProductLog[ 2^n*Log[2]]/Log[2]]]; Table[a[n], {n, 1, 74}] (* From Jean-François Alcover, Dec 13 2011, after M. F. Hasler *)

PROG

(PARI) A103354(n)=floor(solve(X=1, log(n)*2, X-2^(n-X))+1e-9) \\ - M. F. Hasler, Dec 14 2007

(PARI) A103354(n)=floor(n-log(n)/log(2)*(1-1.5/n)) \\ - M. F. Hasler, Dec 14 2007

CROSSREFS

Cf. A006697 (partial sums), A094913.

Sequence in context: A049472 A125229 A122797 * A127038 A175268 A051068

Adjacent sequences:  A103351 A103352 A103353 * A103355 A103356 A103357

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mar 21 2005

EXTENSIONS

Edited by M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Dec 14 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.