OFFSET
1,2
COMMENTS
The binary order of n is ceiling(log_2(n)).
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
EXAMPLE
a(1)=1^0=1. a(2)=2^1=2, a(3)=2^2=4.
MAPLE
A029837 := proc(n) ceil(log[2](n)) ; end proc: A163299 := proc(n) numtheory[tau](n) ^ A029837(n) ; end proc: seq(A163299(n), n=1..100) ; # R. J. Mathar, Oct 10 2009
MATHEMATICA
Table[DivisorSigma[0, n]^(Ceiling[Log[2, n]]), {n, 100}] (* G. C. Greubel, Dec 18 2016 *)
PROG
(PARI) main(size)={return(vector(size, n, (numdiv(n))^(ceil(log(n)/ log(2))))); } \\ Anders Hellström, Jul 13 2015
CROSSREFS
KEYWORD
nonn,base,less
AUTHOR
Juri-Stepan Gerasimov, Jul 26 2009
EXTENSIONS
Examples corrected by R. J. Mathar, Oct 10 2009
STATUS
approved