cp's OEIS Frontend

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

%I A327309 #15 Sep 30 2019 10:47:23
%S A327309 2,4,6,11,13,15,20,22,24,26,31,33,35,40,42,44,46,51,53,55,60,62,64,71,
%T A327309 73,75,80,82,84,91,93,95,100,102,104,109,111,113,115,120,122,124,129,
%U A327309 131,133,135,140,142,144,149,151,153,155,160,162,164,169,171,173
%N A327309 Positions of 2's in {A327306(n) : n > 0}.
%C A327309 The positive integers are partitioned by A327307, A327308, and A327309.
%C A327309 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327309 Positive integers k such that A327306(k) = 2. - _Jianing Song_, Sep 30 2019
%H A327309 Clark Kimberling and Jianing Song, <a href="/A327309/b327309.txt">Table of n, a(n) for n = 1..10000</a>
%t A327309 r = Sqrt[6]; z = 300;
%t A327309 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327306(n) : n > 0} *)
%t A327309 Flatten[Position[t, 0]]  (* A327307 *)
%t A327309 Flatten[Position[t, 1]]  (* A327308 *)
%t A327309 Flatten[Position[t, 2]]  (* A327309 *)
%Y A327309 Cf. A327306, A327307, A327308.
%K A327309 nonn,easy
%O A327309 1,1
%A A327309 _Clark Kimberling_, Sep 07 2019
%E A327309 Corrected by _Jianing Song_, Sep 30 2019