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