%I
%S 1,2,6,7,8,12,13,14,18,19,20,24,25,26,30,31,32,35,36,37,41,42,43,47,
%T 48,49,53,54,55,59,60,61,65,66,67,70,71,72,76,77,78,82,83,84,88,89,90,
%U 94,95,96,100,101,105,106,107,111,112,113,117,118,119,123,124,125
%N Positions of 1's in {A327256(n) : n > 0}.
%C Although a(n)/n>2, the sequence a(n)2n appears to be unbounded.
%C Positive integers k such that A327256(k) = 1.  _Jianing Song_, Sep 30 2019
%H Clark Kimberling and Jianing Song, <a href="/A327258/b327258.txt">Table of n, a(n) for n = 1..10000</a>
%t r = Sqrt[8]; z = 300;
%t t = Table[Floor[2 n r]  2 Floor[n*r], {n, 0, z}] (* {A327256(n) : n > 0} *)
%t Flatten[Position[t, 0]] (* A327257 *)
%t Flatten[Position[t, 1]] (* A327258 *)
%Y Cf. A327256, A327257 (complement).
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Sep 03 2019
%E Corrected by _Jianing Song_, Sep 29 2019
