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!)
A139817 2^n - number of digits of 2^n. 0

%I #10 Apr 05 2015 09:42:11

%S 0,1,3,7,14,30,62,125,253,509,1020,2044,4092,8188,16379,32763,65531,

%T 131066,262138,524282,1048569,2097145,4194297,8388601,16777208,

%U 33554424,67108856,134217719,268435447,536870903,1073741814,2147483638,4294967286,8589934582

%N 2^n - number of digits of 2^n.

%F a(n) = A000079(n) - A055642(A000079(n)). - _Michel Marcus_, Jul 18 2013

%t Table[2^n-IntegerLength[2^n],{n,0,40}] (* _Harvey P. Dale_, Apr 05 2015 *)

%o (PARI) a(n) = 2^n - length(digits(2^n)) \\ _Michel Marcus_, Jul 18 2013

%Y Cf. A000079, A055642.

%K nonn,base

%O 0,3

%A _Rolf Pleisch_, May 23 2008

%E More terms from _N. J. A. Sloane_, Jun 29 2008

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 16:00 EDT 2024. Contains 371254 sequences. (Running on oeis4.)