The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #13 May 08 2019 19:14:32
%S 1,3,6,13,28,58,116,229,456,924,1896,3898,7960,16084,32168,63845,
%T 126160,248968,491952,975388,1943536,3895336,7852688,15906874,
%U 32321264,65736728,133549136,270550228,545928688,1096685608,2193371216,4369711461,8679052960
%N Binomial transform of the Tower of Hanoi sequence.
%H Robert Israel, <a href="/A106461/b106461.txt">Table of n, a(n) for n = 1..3310</a>
%F Binomial transform of A001511, the "ruler" or Tower of Hanoi sequence.
%F a(2^n-1) = 2*a(2^n-2) for n > 1. - _A.H.M. Smeets_, May 08 2019
%e a(4) = 13 = 1*1 + 3*2 + 3*1 + 1*3, where the Tower of Hanoi sequence = (A001511): 1, 2, 1, 3, 1, 2, 1, 4...
%p f:= n -> add(padic:-ordp(2*k,2)*binomial(n-1,k-1),k=1..n):
%p map(f, [$1..100]); # _Robert Israel_, Dec 02 2016
%Y Cf. A001511.
%K nonn,easy
%O 1,2
%A _Gary W. Adamson_, May 02 2005
%E More terms from _N. J. A. Sloane_, May 03 2008