login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086841 a(n) = a((a(n-2))*mod(n,2)+a(n-1)*(1-mod(n,2))) + a((n - a(n-2))*mod(n,2)+(n-a(n-1))*(1-mod(n,2))). 2
1, 1, 2, 2, 3, 4, 4, 4, 5, 6, 7, 7, 8, 8, 8, 8, 9, 10, 11, 12, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 16, 16, 17, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 26, 27, 26, 27, 28, 28, 29, 30, 29, 30, 30, 31, 31, 31, 31, 32, 32, 32, 32, 32, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 41, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Let M = A005229, C = A004001. Then we may define a pair of new sequences by o1 = M*mod(n,2)+C*(1-mod(n,2)) (this sequence), o2 = C*mod(n,2)+M*(1-mod(n,2)) (A086525 - or is it A086335?).
LINKS
MATHEMATICA
digits = 200 Mc[n_Integer?Positive] := Mc[n] = Mc[( Mc[n-2])*(Mod[n, 2])+Mc[n-1]*(1-Mod[n, 2])] + Mc[(n - Mc[n-2])*(Mod[n, 2])+(n-Mc[n-1])*(1-Mod[n, 2])] Mc[1] = Mc[2] = 1 a1=Table[Mc[n], {n, 1, digits}]
CROSSREFS
Cf. A005229, A086525, A086335. Different from A004001.
Sequence in context: A343174 A340205 A004001 * A076502 A076897 A316434
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Sep 15 2003
EXTENSIONS
Edited by N. J. A. Sloane, Nov 07 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)