This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A106461 #13 May 08 2019 19:14:32 %S A106461 1,3,6,13,28,58,116,229,456,924,1896,3898,7960,16084,32168,63845, %T A106461 126160,248968,491952,975388,1943536,3895336,7852688,15906874, %U A106461 32321264,65736728,133549136,270550228,545928688,1096685608,2193371216,4369711461,8679052960 %N A106461 Binomial transform of the Tower of Hanoi sequence. %H A106461 Robert Israel, <a href="/A106461/b106461.txt">Table of n, a(n) for n = 1..3310</a> %F A106461 Binomial transform of A001511, the "ruler" or Tower of Hanoi sequence. %F A106461 a(2^n-1) = 2*a(2^n-2) for n > 1. - _A.H.M. Smeets_, May 08 2019 %e A106461 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 A106461 f:= n -> add(padic:-ordp(2*k,2)*binomial(n-1,k-1),k=1..n): %p A106461 map(f, [$1..100]); # _Robert Israel_, Dec 02 2016 %Y A106461 Cf. A001511. %K A106461 nonn,easy %O A106461 1,2 %A A106461 _Gary W. Adamson_, May 02 2005 %E A106461 More terms from _N. J. A. Sloane_, May 03 2008