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 #21 May 02 2023 17:49:40
%S 1,14,58,80,124,146,168,190,212,234,256,278,300,322,344,699,1054,1409,
%T 1764,2119,2474,2829,3184,3539,3894,4249,4604,4959,5314,5669,6024,
%U 6379,6734,7089,7444,7799,8154,8509,8864,9219,9574,9929,10284,10639,10994
%N Numbers k such that floor(tan(k)) > floor(tan(m)) for all m < k.
%H Harry J. Smith, <a href="/A063537/b063537.txt">Table of n, a(n) for n = 1..170</a>
%t DeleteDuplicates[Table[{n,Floor[Tan[n]]},{n,11000}],GreaterEqual[#1[[2]],#2[[2]]]&][[All,1]] (* _Harvey P. Dale_, Sep 10 2022 *)
%o (PARI) j=[]; for(n=1,25000,b=floor(tan(n)); if(b>a,a=b; j=concat(j,n))); j
%o (PARI) { default(realprecision, 50); n=0; a=0; for (m=1, 10^9, b=floor(tan(m)); if (b>a, a=b; write("b063537.txt", n++, " ", m); if (n==170, break)) ) } \\ _Harry J. Smith_, Aug 25 2009
%Y Cf. A000503, A024814.
%K nonn
%O 1,2
%A _Jason Earls_, Aug 10 2001