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”).
%I #10 Oct 02 2019 05:42:33
%S 2,4,6,9,11,13,16,18,20,22,23,25,27,29,30,32,34,36,38,41,43,45,48,50,
%T 52,54,55,57,59,61,62,64,66,68,69,71,73,75,77,80,82,84,87,89,91,93,94,
%U 96,98,100,101,103,105,107,109,112,114,116,119,121,123,125
%N Positions of 1's in {A327211(n) : n > 0}.
%C Although a(n)/n->2, the sequence 2*n-a(n) appears to be unbounded below and above.
%C Positive integers k such that A327211(k) = 1. - _Jianing Song_, Sep 30 2019
%H Clark Kimberling and Jianing Song, <a href="/A327213/b327213.txt">Table of n, a(n) for n = 1..10000</a>
%t r = E; z = 200;
%t t = Table[Floor[(2 n + 2)*r] - Floor[n*r + 2 r] - Floor[n*r], {n, 1, z}] (* {A327211(n) : n > 0} *)
%t Flatten[Position[t, 0]] (* A327212 *)
%t Flatten[Position[t, 1]] (* A327213 *)
%Y Cf. A327211, A327212 (complement).
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Sep 02 2019
%E Corrected by _Jianing Song_, Sep 30 2019