cp's OEIS Frontend

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

%I A327301 #15 Sep 30 2019 10:43:19
%S A327301 5,6,7,12,13,14,19,20,21,26,27,28,33,34,35,41,42,48,49,55,56,62,63,69,
%T A327301 70,76,77,83,84,90,91,97,98,104,105,111,112,113,118,119,120,125,126,
%U A327301 127,132,133,134,139,140,141,146,147,148,154,155,161,162,168,169,175
%N A327301 Positions of 2's in {A327298(n) : n > 0}.
%C A327301 The positive integers are partitioned by A327299, A327300, and A327301.
%C A327301 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327301 Positive integers k such that A327298(k) = 2. - _Jianing Song_, Sep 30 2019
%H A327301 Clark Kimberling and Jianing Song, <a href="/A327301/b327301.txt">Table of n, a(n) for n = 1..10000</a>
%t A327301 r = Pi; z = 300;
%t A327301 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327298(n) : n > 0} *)
%t A327301 Flatten[Position[t, 0]]  (* A327299 *)
%t A327301 Flatten[Position[t, 1]]  (* A327300 *)
%t A327301 Flatten[Position[t, 2]]  (* A327301 *)
%Y A327301 Cf. A327298, A327299, A327300.
%K A327301 nonn,easy
%O A327301 1,1
%A A327301 _Clark Kimberling_, Sep 06 2019
%E A327301 Corrected by _Jianing Song_, Sep 30 2019