A327312 - OEIS

%I #15 Sep 30 2019 10:46:01

%S 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 73,78,79,84,85,90,91,96,97,102,107,108,113,114,119,120,125,126,131,

%U 132,136,137,142,143,148,149,154,155,160,161,166,167,171,172

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

%C The positive integers are partitioned by A327311, A327312, and A327313.

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

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

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

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

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

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

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

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

%Y Cf. A327310, A327311, A327313.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Sep 07 2019

%E Corrected by _Jianing Song_, Sep 30 2019