A327309 - OEIS

%I #15 Sep 30 2019 10:47:23

%S 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 73,75,80,82,84,91,93,95,100,102,104,109,111,113,115,120,122,124,129,

%U 131,133,135,140,142,144,149,151,153,155,160,162,164,169,171,173

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

%C The positive integers are partitioned by A327307, A327308, and A327309.

%C Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.

%C Positive integers k such that A327306(k) = 2. - _Jianing Song_, Sep 30 2019

%H Clark Kimberling and Jianing Song, <a href="/A327309/b327309.txt">Table of n, a(n) for n = 1..10000</a>

%t r = Sqrt[6]; z = 300;

%t t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327306(n) : n > 0} *)

%t Flatten[Position[t, 0]]  (* A327307 *)

%t Flatten[Position[t, 1]]  (* A327308 *)

%t Flatten[Position[t, 2]]  (* A327309 *)

%Y Cf. A327306, A327307, A327308.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Sep 07 2019

%E Corrected by _Jianing Song_, Sep 30 2019