This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A246411 #10 Sep 01 2014 04:57:40 %S A246411 1,3,5,7,9,11,13,15,17,19,21,24,26,28,30,32,34,36,38,40,42,45,47,49, %T A246411 51,53,55,57,59,61,63,65,68,70,72,74,76,78,80,82,84,86,89,91,93,95,97, %U A246411 99,101,103,105,107,109,112,114,116,118,120,122,124,126,128 %N A246411 Positive integers k satisfying csc(k) > csc(k+1) < csc(k+2). %C A246411 A246410, a(n), and A246412 partition the positive integers. %H A246411 Clark Kimberling, <a href="/A246411/b246411.txt">Table of n, a(n) for n = 1..1000</a> %F A246411 a(n) = A158333(n-1) for n<73. - _R. J. Mathar_, Sep 01 2014 %t A246411 z = 200; f[x_] := f[x] = Csc[x]; %t A246411 Select[Range[1, z], f[#] < f[# + 1] &] (*A246410*) %t A246411 Select[Range[1, z], f[#] > f[# + 1] < f[# + 2] &] (*A246411*) %t A246411 Select[Range[1, 10 z], f[#] > f[# + 1] > f[# + 2] < f[# + 3] &] (*A246412*) %Y A246411 Cf. A246410, A246412. %K A246411 nonn,easy %O A246411 1,2 %A A246411 _Clark Kimberling_, Aug 25 2014