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

2, 4, 6, 11, 13, 15, 20, 22, 24, 26, 31, 33, 35, 40, 42, 44, 46, 51, 53, 55, 60, 62, 64, 71, 73, 75, 80, 82, 84, 91, 93, 95, 100, 102, 104, 109, 111, 113, 115, 120, 122, 124, 129, 131, 133, 135, 140, 142, 144, 149, 151, 153, 155, 160, 162, 164, 169, 171, 173

Offset

1,1

Comments

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

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

Positive integers k such that A327306(k) = 2. - Jianing Song, Sep 30 2019

Links

Clark Kimberling and Jianing Song, Table of n, a(n) for n = 1..10000

Mathematica

r = Sqrt[6]; z = 300;
t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}]  (* {A327306(n) : n > 0} *)
Flatten[Position[t, 0]]  (* A327307 *)
Flatten[Position[t, 1]]  (* A327308 *)
Flatten[Position[t, 2]]  (* A327309 *)

Crossrefs

Cf. A327306, A327307, A327308.

Sequence in context: A292924 A015903 A224860 * A350668 A078198 A171865

Adjacent sequences: A327306 A327307 A327308 * A327310 A327311 A327312

Keyword

nonn,easy

Author

Clark Kimberling, Sep 07 2019

Extensions

Corrected by Jianing Song, Sep 30 2019

Status

approved