This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249041 Number of odd terms in first n terms of A249039. 3
 1, 1, 1, 2, 3, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 7, 8, 8, 9, 10, 11, 12, 13, 13, 14, 15, 16, 16, 17, 17, 17, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 23, 23, 23, 24, 25, 25, 26, 26, 26, 26, 27, 27, 27, 28, 29, 29, 30, 31, 32, 32, 33, 33, 33, 34, 35, 35, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 Rémy Sigrist, Colored scatterplot of (a(n-1-a(n-1))/n, a(a(n-1))/n) for n <= 500000000 (where the hue is function of n) FORMULA For n > 2: a(n) = a(n-1) + A249039(n) mod 2. - Reinhard Zumkeller, Nov 11 2014 a(n) = n - a(a(n-1)) - a(n-1-a(n-1)) with a(1) = a(2) = 1. - Altug Alkan, May 01 2019 MAPLE See A249039. PROG (Haskell) a249041 n = a249041_list !! (n-1) a249041_list = tail \$ scanl (\i j -> i + mod j 2) 0 a249039_list -- Reinhard Zumkeller, Nov 11 2014 CROSSREFS Cf. A249039, A249040, A287422. Sequence in context: A082090 A060197 A116487 * A070546 A034586 A268383 Adjacent sequences:  A249038 A249039 A249040 * A249042 A249043 A249044 KEYWORD nonn AUTHOR N. J. A. Sloane, Oct 26 2014 STATUS approved

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

Last modified December 15 14:37 EST 2019. Contains 329999 sequences. (Running on oeis4.)