A319863 a(2n) = a(n) + a(n+1) + n (n > 1), a(2n+1) = a(n) + a(n-1) + 1 (n >= 1) with a(0) = a(1) = 1 and a(2) = 2.

1, 1, 2, 3, 7, 4, 13, 6, 15, 11, 22, 12, 25, 18, 28, 20, 34, 22, 42, 27, 44, 34, 48, 35, 55, 38, 59, 44, 62, 47, 69, 49, 72, 55, 81, 57, 87, 65, 90, 70, 98, 72, 103, 79, 105, 83, 113, 84, 117, 91, 122, 94, 129, 98, 133, 104, 137, 107, 145, 110, 148, 117, 152

Offset

0,3

Comments

A "convoluted recurrence".

Links

Table of n, a(n) for n=0..62.

J.-P. Allouche and J. Shallit, The ring of k-regular sequences, Theoretical Computer Sci., 98 (1992), 163-197.

J.-P. Allouche and J. Shallit, The ring of k-regular sequences, II, Theoret. Computer Sci., 307 (2003), 3-29.

Math Stackexchange, convoluted recurrence: f(2n)=f(n)+f(n+1)+n,f(2n+1)=f(n)+f(n-1)+1, November 30 2014.

Crossrefs

Sequence in context: A168085 A287950 A287628 * A320948 A086885 A324598

Adjacent sequences: A319860 A319861 A319862 * A319864 A319865 A319866

Keyword

nonn

Author

Jeffrey Shallit, Sep 29 2018

Status

approved