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

 

Logo
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

%I #19 Aug 20 2017 17:19:47

%S 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,

%T 23,24,25,26,27,28,29,30,31,32,32,33,34,35,36,37,38,39,40,41,42,43,44,

%U 45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,64,65,66,67

%N a(n) = floor(x), where x is the solution to x = 2^(n-x).

%C 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]

%H Robert Israel, <a href="/A103354/b103354.txt">Table of n, a(n) for n = 1..10000</a>

%H J.-P. Allouche, J. Shallit, <a href="http://arxiv.org/abs/1605.02361">On the subword complexity of the fixed point of a -> aab, b -> b, and generalizations</a>, arXiv preprint arXiv:1605.02361 [math.CO], 2016.

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

%F 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

%p A[1]:= 1;

%p for n from 2 to 100 do

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

%p A[n]:= x-1;

%p od:

%p seq(A[i],i=1..100); # _Robert Israel_, Dec 04 2016

%t 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_ *)

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

%o (PARI) A103354(n)=floor(n-log(n)/log(2)*(1-1.5/n)) \\ _M. F. Hasler_, Dec 14 2007

%Y Cf. A006697 (partial sums), A094913.

%K nonn

%O 1,3

%A _N. J. A. Sloane_, Mar 21 2005

%E Edited by _M. F. Hasler_, Dec 14 2007

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)