A192099 -id:A192099 - cp's OEIS frontend

Showing 1-1 of 1 results.

A192101 Least number requiring n terms to express it as a sum of signed terms of the form 2^k-1.

Original entry on oeis.org

1, 2, 5, 20, 83, 594, 2641, 10856, 43623, 305766, 1354341, 5548644, 22325859, 89434722, 357870241, 1431612752, 5726580047

Offset: 1

Frank Ruskey, Jul 29 2011

a(n) = min{ i : A192099(i) = n }

Conjecture: a(n) = (4^n)/3 + O(1).

			The smallest value of i for which A192099(i) = 5 is 83 = 31+15+7-3+1, and so a(5) = 83.

Isoperimetric sequences for infinite complete binary trees and their relation to meta-Fibonacci sequences and signed almost binary partitions, talk at CANADAM, 2009.

Showing 1-1 of 1 results.