cp's OEIS Frontend

A327313 Positions of 2's in {A327310(n) : n > 0}.

%I A327313 #15 Sep 30 2019 10:44:45
%S A327313 1,6,7,12,13,18,19,24,25,30,31,35,36,41,42,47,48,53,54,59,60,65,66,70,
%T A327313 71,76,77,82,83,88,89,94,95,100,101,105,106,111,112,117,118,123,124,
%U A327313 129,130,135,140,141,146,147,152,153,158,159,164,165,170,175
%N A327313 Positions of 2's in {A327310(n) : n > 0}.
%C A327313 The positive integers are partitioned by A327311, A327312, and A327313.
%C A327313 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327313 Positive integers k such that A327310(k) = 2. - _Jianing Song_, Sep 30 2019
%H A327313 Clark Kimberling and Jianing Song, <a href="/A327313/b327313.txt">Table of n, a(n) for n = 1..10000</a>
%t A327313 r = Sqrt[8]; z = 300;
%t A327313 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327310(n) : n > 0} *)
%t A327313 Flatten[Position[t, 0]]  (* A327311 *)
%t A327313 Flatten[Position[t, 1]]  (* A327312 *)
%t A327313 Flatten[Position[t, 2]]  (* A327313 *)
%Y A327313 Cf. A327310, A327311, A327312.
%K A327313 nonn,easy
%O A327313 1,2
%A A327313 _Clark Kimberling_, Sep 07 2019
%E A327313 Corrected by _Jianing Song_, Sep 30 2019