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 Jul 02 2019 22:26:21
%S 1,7,7,8,9,9,10,11,13,15,17,20,25,32,45,75,227,229,230,232,233,235,
%T 237,238,240,242,244,246,247,249,251,253,255,257,259,261,263,265,267,
%U 270,272,274,276,279,281,283,286,288,291,294,296,299,302,304,307,310,313,316,319,322,325
%N a(n) = floor(tan m), where m is the least positive integer such that floor(tan m) > floor(tan k) for k = 0,1,...,m-1.
%H Michel Marcus, <a href="/A024818/b024818.txt">Table of n, a(n) for n = 1..177</a>
%F a(n) = floor(tan(A024814(n))). - _N. J. A. Sloane_, Jun 29 2019
%Y Cf. A000503, A024814.
%K nonn
%O 1,2
%A _Clark Kimberling_