OFFSET
4,1
COMMENTS
For all k >= 0, there is a unique sequence satisfying a^(k+1)=2n. The first differences are 1^k, 2^1, 1^2k, 2^2, 1^4k, 2^4, 1^8k, ...
LINKS
H.-K. Hwang, S. Janson, T.-H. Tsai. Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications. Preprint, 2016.
H.-K. Hwang, S. Janson, T.-H. Tsai. Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications. ACM Transactions on Algorithms, 13:4 (2017), #47. DOI:10.1145/3127585.
FORMULA
First differences are 1^3, 2^1, 1^6, 2^2, 1^12, 2^4, 1^24, 2^8, ...
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Colin Mallows, Oct 12 2003
STATUS
approved