OFFSET
1,1
REFERENCES
Hsien-Kuei Hwang, S Janson, TH 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; http://140.109.74.92/hk/wp-content/files/2016/12/aat-hhrr-1.pdf. Also 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(a(n))} = {2i : i >= 3}.
PROG
(PARI) lista(nn) = {v = vector(nn); v[1] = 3; prev = v[1]; for (n=2, nn, new = prev+1; if (vecsearch(vecsort(v, , 8), n) && (new % 2), new ++); v[n] = new; prev = new; ); v; } \\ Michel Marcus, Feb 16 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Mar 01 2003
EXTENSIONS
More terms from Matthew Vandermast, Mar 05 2003
STATUS
approved