login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103354 a(n) = floor(x), where x is the solution to x = 2^(n-x). 9
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; text; internal format)
OFFSET

1,3

COMMENTS

Partial sums seem to be A006697(n-1) = A094913(n-1) + 1. - M. F. Hasler, Dec 14 2007 [Confirmed by Allouche and Shallit, 2016. - N. J. A. Sloane, Mar 24 2017]

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

J.-P. Allouche, J. Shallit, On the subword complexity of the fixed point of a -> aab, b -> b, and generalizations, arXiv preprint arXiv:1605.02361 [math.CO], 2016.

FORMULA

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

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

MAPLE

A[1]:= 1;

for n from 2 to 100 do

for x from A[n-1] while x <= 2^(n-x) do od;

A[n]:= x-1;

od:

seq(A[i], i=1..100); # Robert Israel, Dec 04 2016

MATHEMATICA

a[n_] := Floor[ FullSimplify[ ProductLog[ 2^n*Log[2]]/Log[2]]]; Table[a[n], {n, 1, 74}] (* 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: A281957 A286389 A309945 * A127038 A175268 A241948

Adjacent sequences: A103351 A103352 A103353 * A103355 A103356 A103357

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mar 21 2005

EXTENSIONS

Edited by M. F. Hasler, Dec 14 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 07:58 EST 2022. Contains 358515 sequences. (Running on oeis4.)