|
%I #12 May 02 2019 09:50:57
%S 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,
%T 17,17,18,19,19,20,20,20,20,21,21,21,21,21,21,21,22,22,22,22,22,23,23,
%U 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
%N Number of odd terms in first n terms of A249039.
%H Reinhard Zumkeller, <a href="/A249041/b249041.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A249041/a249041.png">Colored scatterplot of (a(n-1-a(n-1))/n, a(a(n-1))/n) for n <= 500000000</a> (where the hue is function of n)
%F For n > 2: a(n) = a(n-1) + A249039(n) mod 2. - _Reinhard Zumkeller_, Nov 11 2014
%F a(n) = n - a(a(n-1)) - a(n-1-a(n-1)) with a(1) = a(2) = 1. - _Altug Alkan_, May 01 2019
%p See A249039.
%o (Haskell)
%o a249041 n = a249041_list !! (n-1)
%o a249041_list = tail $ scanl (\i j -> i + mod j 2) 0 a249039_list
%o -- _Reinhard Zumkeller_, Nov 11 2014
%Y Cf. A249039, A249040, A287422.
%K nonn
%O 1,4
%A _N. J. A. Sloane_, Oct 26 2014
|
