The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106461 Binomial transform of the Tower of Hanoi sequence. 3
 1, 3, 6, 13, 28, 58, 116, 229, 456, 924, 1896, 3898, 7960, 16084, 32168, 63845, 126160, 248968, 491952, 975388, 1943536, 3895336, 7852688, 15906874, 32321264, 65736728, 133549136, 270550228, 545928688, 1096685608, 2193371216, 4369711461, 8679052960 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Robert Israel, Table of n, a(n) for n = 1..3310 FORMULA Binomial transform of A001511, the "ruler" or Tower of Hanoi sequence. a(2^n-1) = 2*a(2^n-2) for n > 1. - A.H.M. Smeets, May 08 2019 EXAMPLE 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... MAPLE f:= n -> add(padic:-ordp(2*k, 2)*binomial(n-1, k-1), k=1..n): map(f, [\$1..100]); # Robert Israel, Dec 02 2016 CROSSREFS Cf. A001511. Sequence in context: A125777 A103788 A182137 * A095768 A002478 A106496 Adjacent sequences:  A106458 A106459 A106460 * A106462 A106463 A106464 KEYWORD nonn,easy AUTHOR Gary W. Adamson, May 02 2005 EXTENSIONS More terms from N. J. A. Sloane, May 03 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 30 22:26 EDT 2020. Contains 337440 sequences. (Running on oeis4.)