A327207 - OEIS

%I #11 Oct 02 2019 05:39:28

%S 2,4,7,9,10,12,14,16,19,21,22,24,26,28,31,33,36,38,39,41,43,45,48,50,

%T 51,53,55,57,60,62,63,65,67,68,70,72,74,77,79,80,82,84,86,89,91,92,94,

%U 96,98,101,103,106,108,109,111,113,115,118,120,121,123,125

%N Positions of 1's in {A327205(n) : n > 0}.

%C Although a(n)/n->2, the sequence 2*n-a(n) appears to be unbounded below and above.

%C Positive integers k such that A327205(k) = 0. - _Jianing Song_, Sep 30 2019

%H Clark Kimberling and Jianing Song, <a href="/A327207/b327207.txt">Table of n, a(n) for n = 1..10000</a>

%t r = Sqrt[2]; z = 200;

%t t = Table[Floor[(2 n + 2)*r] - Floor[n*r + 2 r] - Floor[n*r], {n, 1, z}]  (* {A327205(n) : n > 0} *)

%t Flatten[Position[t, 0]] (* A327206 *)

%t Flatten[Position[t, 1]] (* A327207 *)

%Y Cf. A327205, A327206 (complement).

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Aug 26 2019

%E Corrected by _Jianing Song_, Sep 30 2019