OFFSET
1,2
COMMENTS
Terms computed by Gilles Sadowski. In building step by step the sequence one has sometimes the choice for an integer. If so take the smallest available one.
{a(n)} is the lexicographically earliest monotonic sequence of positive integers satisfying a(a(n)+1) = 2*n. - Yifan Xie, Jun 25 2024
LINKS
Hsien-Kuei Hwang, S. Janson, and 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.
Hsien-Kuei Hwang, S. Janson, and 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
a(n) = A007378(n+1) - 2. - Benoit Cloitre, May 22 2008
EXAMPLE
a(7)=10 because there are 10 integers in the sequence which are strictly < 14 (they are 1,2,4,5,6,8,10,11,12,13)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Eric Angelini, Feb 01 2006
STATUS
approved