cp's OEIS Frontend

A327307 Positions of 0's in {A327306(n) : n > 0}.

%I A327307 #16 Sep 30 2019 10:43:10
%S A327307 5,7,9,14,16,18,25,27,29,34,36,38,43,45,47,49,54,56,58,63,65,67,69,74,
%T A327307 76,78,83,85,87,89,94,96,98,103,105,107,114,116,118,123,125,127,132,
%U A327307 134,136,138,143,145,147,152,154,156,158,163,165,167,172,174
%N A327307 Positions of 0's in {A327306(n) : n > 0}.
%C A327307 The positive integers are partitioned by A327307, A327308, and A327309.
%C A327307 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327307 Positive integers k such that A327306(k) = 0. - _Jianing Song_, Sep 30 2019
%H A327307 Clark Kimberling and Jianing Song, <a href="/A327307/b327307.txt">Table of n, a(n) for n = 1..10000</a>
%t A327307 r = Sqrt[6]; z = 300;
%t A327307 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327306(n) : n > 0} *)
%t A327307 Flatten[Position[t, 0]]  (* A327307 *)
%t A327307 Flatten[Position[t, 1]]  (* A327308 *)
%t A327307 Flatten[Position[t, 2]]  (* A327309 *)
%Y A327307 Cf. A327306, A327308, A327309.
%K A327307 nonn,easy
%O A327307 1,1
%A A327307 _Clark Kimberling_, Sep 07 2019
%E A327307 Corrected by _Jianing Song_, Sep 30 2019