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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 30 2012 18:52:34
%S 0,1,16,128,729,531441,6561,14348907,67108864,68719476736,16777216,
%T 72057594037927936,268435456,281474976710656,281474976710656,
%U 4611686018427387904,3814697265625,1818989403545856475830078125
%N a(n)=(the binary order of n)^sigma(n)
%C Here sigma(n)=the sum of the divisors of n and the binary order of n: log_2(n) rounded up to next integer.
%H J. Mulder, <a href="/A163399/b163399.txt">Table of n, a(n) for n = 1..350</a>
%F a(n)=A029837(n)^sigma(n).
%e a(1)=0^1=0, a(2)=1^3=1, a(3)=2^4=16.
%t Array[Ceiling[Log2[ # ]]^DivisorSigma[1, # ] &, 350] [From Jasper Mulder (jasper.mulder(AT)planet.nl), Jun 03 2010]
%Y Cf. A000005, A029837.
%K nonn
%O 1,3
%A _Juri-Stepan Gerasimov_, Jul 26 2009
%E Corrected (243 replaced by 729, 6708864 by 67108864) and extended by _R. J. Mathar_, May 21 2010
%E Definition corrected by Jasper Mulder (jasper.mulder(AT)planet.nl), Jun 03 2010