cp's OEIS Frontend

A327257 Positions of 0's in {A327256(n) : n > 0}.

%I A327257 #19 Sep 30 2019 10:43:57
%S A327257 3,4,5,9,10,11,15,16,17,21,22,23,27,28,29,33,34,38,39,40,44,45,46,50,
%T A327257 51,52,56,57,58,62,63,64,68,69,73,74,75,79,80,81,85,86,87,91,92,93,97,
%U A327257 98,99,102,103,104,108,109,110,114,115,116,120,121,122
%N A327257 Positions of 0's in {A327256(n) : n > 0}.
%C A327257 Although a(n)/n->2, the sequence a(n)-2n appears to be unbounded.
%C A327257 Positive integers k such that A327256(k) = 0. - _Jianing Song_, Sep 30 2019
%H A327257 Clark Kimberling and Jianing Song, <a href="/A327257/b327257.txt">Table of n, a(n) for n = 1..10000</a>
%t A327257 r = Sqrt[8]; z = 300;
%t A327257 t = Table[Floor[2 n r] - 2 Floor[n*r], {n, 1, z}]  (* {A327256(n) : n > 0} *)
%t A327257 Flatten[Position[t, 0]]  (* A327257 *)
%t A327257 Flatten[Position[t, 1]]  (* A327258 *)
%Y A327257 Cf. A327256, A327258 (complement).
%K A327257 nonn,easy
%O A327257 1,1
%A A327257 _Clark Kimberling_, Sep 03 2019
%E A327257 Corrected by _Jianing Song_, Sep 29 2019