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!)
 A259823 a(0)=0, a(1)=1, a(n)=min{3 a(k) + 2^(n-k)-1, k=0..(n-1)} for n>=2. 2
 0, 1, 3, 6, 10, 16, 24, 33, 45, 61, 79, 103, 130, 162, 198, 246, 300, 364, 436, 517, 613, 721, 849, 993, 1155, 1347, 1563, 1806, 2062, 2350, 2674, 3058, 3490, 3976, 4488, 5064, 5712, 6441, 7209, 8073, 9045, 10069, 11221, 12517, 13975, 15511, 17239, 19183 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The sequence of first differences is A003586. LINKS Gheorghe Coserea and Reinhard Zumkeller, Table of n, a(n) for n = 0..10000, First 4096 terms from Gheorghe Coserea Thierry Bousch, La Tour de Stockmeyer, SÃ©minaire Lotharingien de Combinatoire 77 (2017), Article B77d. Jonathan Chappelon and Akihiro Matsuura, On generalized Frame-Stewart numbers, arXiv:1009.0146 [math.NT], 2010. FORMULA a(n) = min {3*a(k) + 2^(n-k)-1; k < n}. a(n) = Sum_{i=0..n-1} A003586(i). MATHEMATICA a[n_] := a[n] = Min[ Table[ 3*a[k] + 2^(n-k) - 1, {k, 0, n-1}]]; a[0] = 0; Table[a[n], {n, 0, 60}] PROG (Haskell) a259823 n = a259823_list !! n a259823_list = scanl (+) 0 a003586_list -- Reinhard Zumkeller, Jul 19 2015 CROSSREFS Cf. A003586. Sequence in context: A256529 A256528 A066377 * A264847 A173653 A122046 Adjacent sequences:  A259820 A259821 A259822 * A259824 A259825 A259826 KEYWORD nonn AUTHOR Gheorghe Coserea, Jul 05 2015 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 April 6 05:38 EDT 2020. Contains 333267 sequences. (Running on oeis4.)