cp's OEIS Frontend

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

%I A327300 #15 Sep 30 2019 10:43:29
%S A327300 3,4,10,11,17,18,24,25,31,32,38,39,40,45,46,47,52,53,54,59,60,61,66,
%T A327300 67,68,73,74,75,81,82,88,89,95,96,102,103,109,110,116,117,123,124,130,
%U A327300 131,137,138,144,145,151,152,153,158,159,160,165,166,167,172,173,174
%N A327300 Positions of 1's in {A327298(n) : n > 0}.
%C A327300 The positive integers are partitioned by A327299, A327300, and A327301.
%C A327300 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327300 Positive integers k such that A327298(k) = 1. - _Jianing Song_, Sep 30 2019
%H A327300 Clark Kimberling and Jianing Song, <a href="/A327300/b327300.txt">Table of n, a(n) for n = 1..10000</a>
%t A327300 r = Pi; z = 300;
%t A327300 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327298(n) : n > 0} *)
%t A327300 Flatten[Position[t, 0]]  (* A327299 *)
%t A327300 Flatten[Position[t, 1]]  (* A327300 *)
%t A327300 Flatten[Position[t, 2]]  (* A327301 *)
%Y A327300 Cf. A327298, A327299, A327301.
%K A327300 nonn,easy
%O A327300 1,1
%A A327300 _Clark Kimberling_, Sep 06 2019
%E A327300 Corrected by _Jianing Song_, Sep 30 2019