login

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”).

A327313
Positions of 2's in {A327310(n) : n > 0}.
5
1, 6, 7, 12, 13, 18, 19, 24, 25, 30, 31, 35, 36, 41, 42, 47, 48, 53, 54, 59, 60, 65, 66, 70, 71, 76, 77, 82, 83, 88, 89, 94, 95, 100, 101, 105, 106, 111, 112, 117, 118, 123, 124, 129, 130, 135, 140, 141, 146, 147, 152, 153, 158, 159, 164, 165, 170, 175
OFFSET
1,2
COMMENTS
The positive integers are partitioned by A327311, A327312, and A327313.
Although a(n)/n->3, the sequence a(n)-3n appears to be unbounded.
Positive integers k such that A327310(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[8]; z = 300;
t = Table[Floor[3 n*r] - 3 Floor[n*r], {n, 1, z}] (* {A327310(n) : n > 0} *)
Flatten[Position[t, 0]] (* A327311 *)
Flatten[Position[t, 1]] (* A327312 *)
Flatten[Position[t, 2]] (* A327313 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Sep 07 2019
EXTENSIONS
Corrected by Jianing Song, Sep 30 2019
STATUS
approved