cp's OEIS Frontend

A327299 Positions of 0's in {A327298(n) : n > 0}.

%I A327299 #15 Sep 30 2019 10:43:38
%S A327299 1,2,8,9,15,16,22,23,29,30,36,37,43,44,50,51,57,58,64,65,71,72,78,79,
%T A327299 80,85,86,87,92,93,94,99,100,101,106,107,108,114,115,121,122,128,129,
%U A327299 135,136,142,143,149,150,156,157,163,164,170,171
%N A327299 Positions of 0's in {A327298(n) : n > 0}.
%C A327299 The positive integers are partitioned by A327299, A327300, and A327301.
%C A327299 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327299 Positive integers k such that A327298(k) = 0. - _Jianing Song_, Sep 30 2019
%H A327299 Clark Kimberling and Jianing Song, <a href="/A327299/b327299.txt">Table of n, a(n) for n = 1..10000</a>
%t A327299 r = Pi; z = 300;
%t A327299 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327298(n) : n > 0} *)
%t A327299 Flatten[Position[t, 0]]  (* A327299 *)
%t A327299 Flatten[Position[t, 1]]  (* A327300 *)
%t A327299 Flatten[Position[t, 2]]  (* A327301 *)
%Y A327299 Cf. A327298, A327300, A327301.
%K A327299 nonn,easy
%O A327299 1,2
%A A327299 _Clark Kimberling_, Sep 06 2019
%E A327299 Corrected by _Jianing Song_, Sep 30 2019