login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A086525
a(n) = a(( a(n-2))*(1-mod(n,2))+a(n-1)*(mod(n,2))) + a((n - a(n-2))*(1-mod(n,2))+(n-a(n-1))*(mod(n,2))).
1
1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 13, 13, 14, 15, 16, 16, 17, 18, 18, 19, 20, 20, 21, 22, 23, 23, 24, 25, 25, 26, 27, 27, 28, 29, 30, 30, 31, 32, 32, 33, 34, 34, 35, 36, 37, 37, 38, 39, 40, 40, 41, 42, 42, 43, 44, 44, 45, 46, 47, 47, 48, 49, 50, 50, 51, 52, 52
OFFSET
1,3
COMMENTS
The sequence o2 mentioned in A086841.
MATHEMATICA
digits=200 Mc[n_Integer?Positive] :Mc[n] =Mc[( Mc[n-2])*(1-Mod[n, 2])+Mc[n-1]*(Mod[n, 2])] + Mc[(n - Mc[n-2])*(1-Mod[n, 2])+(n-Mc[n-1])*(Mod[n, 2])] Mc[1] = Mc[2] = 1 a1=Table[Mc[n], {n, 1, digits}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Sep 14 2003
EXTENSIONS
Edited by N. J. A. Sloane, Nov 07 2007
STATUS
approved