cp's OEIS Frontend

A327311 Positions of 0's in {A327310(n) : n > 0}.

%I A327311 #15 Sep 30 2019 10:47:32
%S A327311 4,5,10,11,16,17,22,23,28,29,34,39,40,45,46,51,52,57,58,63,64,68,69,
%T A327311 74,75,80,81,86,87,92,93,98,99,103,104,109,110,115,116,121,122,127,
%U A327311 128,133,134,138,139,144,145,150,151,156,157,162,163,168,169,173,174
%N A327311 Positions of 0's in {A327310(n) : n > 0}.
%C A327311 The positive integers are partitioned by A327311, A327312, and A327313.
%C A327311 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327311 Positive integers k such that A327310(k) = 0. - _Jianing Song_, Sep 30 2019
%H A327311 Clark Kimberling and Jianing Song, <a href="/A327311/b327311.txt">Table of n, a(n) for n = 1..10000</a>
%t A327311 r = Sqrt[8]; z = 300;
%t A327311 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327310(n) : n > 0} *)
%t A327311 Flatten[Position[t, 0]]  (* A327311 *)
%t A327311 Flatten[Position[t, 1]]  (* A327312 *)
%t A327311 Flatten[Position[t, 2]]  (* A327313 *)
%Y A327311 Cf. A327310, A327312, A327313.
%K A327311 nonn,easy
%O A327311 1,1
%A A327311 _Clark Kimberling_, Sep 07 2019
%E A327311 Corrected by _Jianing Song_, Sep 30 2019