OFFSET
1,2
COMMENTS
The length of the binary expansion of n is ceiling(log_2(n)).
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
FORMULA
MAPLE
A029837 := proc(n) ceil(log[2](n)) ; end: A163297 := proc(n) numtheory[sigma](n)+A029837(n) ; end: seq(A163297(n), n=1..100) ; # R. J. Mathar, Jul 26 2009
MATHEMATICA
Table[DivisorSigma[1, n]+Ceiling[Log[2, n]], {n, 70}] (* Harvey P. Dale, Nov 21 2014 *)
PROG
(PARI) vector(60, n, sigma(n)+ceil(log(n)/log(2))) \\ Michel Marcus, Jul 14 2015
(Magma) [SumOfDivisors(n)+Ceiling(Log(n)/Log(2)) : n in [1..70]]; // Vincenzo Librandi, Jul 14 2015
CROSSREFS
KEYWORD
nonn,base,less
AUTHOR
Juri-Stepan Gerasimov, Jul 25 2009
EXTENSIONS
A 37 changed to 36 by R. J. Mathar, Jul 26 2009
STATUS
approved