cp's OEIS Frontend

A327312 Positions of 1's in {A327310(n) : n > 0}.

%I A327312 #15 Sep 30 2019 10:46:01
%S A327312 2,3,8,9,14,15,20,21,26,27,32,33,37,38,43,44,49,50,55,56,61,62,67,72,
%T A327312 73,78,79,84,85,90,91,96,97,102,107,108,113,114,119,120,125,126,131,
%U A327312 132,136,137,142,143,148,149,154,155,160,161,166,167,171,172
%N A327312 Positions of 1's in {A327310(n) : n > 0}.
%C A327312 The positive integers are partitioned by A327311, A327312, and A327313.
%C A327312 Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
%C A327312 Positive integers k such that A327310(k) = 1. - _Jianing Song_, Sep 30 2019
%H A327312 Clark Kimberling and Jianing Song, <a href="/A327312/b327312.txt">Table of n, a(n) for n = 1..10000</a>
%t A327312 r = Sqrt[8]; z = 300;
%t A327312 t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327310(n) : n > 0} *)
%t A327312 Flatten[Position[t, 0]]  (* A327311 *)
%t A327312 Flatten[Position[t, 1]]  (* A327312 *)
%t A327312 Flatten[Position[t, 2]]  (* A327313 *)
%Y A327312 Cf. A327310, A327311, A327313.
%K A327312 nonn,easy
%O A327312 1,1
%A A327312 _Clark Kimberling_, Sep 07 2019
%E A327312 Corrected by _Jianing Song_, Sep 30 2019