A327309 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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