The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079044 Numbers k such that Sum_{j=0..k} sin(j/Pi) < 0. 0
 19, 39, 59, 78, 98, 118, 138, 157, 177, 197, 217, 236, 256, 276, 296, 315, 335, 355, 375, 394, 414, 434, 454, 473, 493, 513, 532, 552, 572, 592, 611, 631, 651, 671, 690, 710, 730, 750, 769, 789, 809, 829, 848, 868, 888, 908, 927, 947, 967, 986 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) is asymptotic to c*n where c=19.7... Conjecture: a(n) = floor( 2 * Pi^2 * n ), checked for n <= 10^4. - Vincenzo Librandi, Sep 03 2015 From Vaclav Kotesovec, Feb 15 2019: (Start) Numbers k such that sin(k/(2*Pi)) * sin((k+1)/(2*Pi)) < 0. Numbers k such that cos((2*k+1)/(2*Pi)) > cos(1/(2*Pi)). Numbers k such that k+1 > 2*Pi^2*(floor(k/(2*Pi^2))+1). Numbers k such that k mod (2*Pi^2) > 2*Pi^2 - 1. (End) MATHEMATICA Select[Range[1, 1000], Sum[Sin[k/Pi], {k, 0, #}] < 0&] (* Vaclav Kotesovec, Feb 15 2019 *) Select[Range[1, 1000], Cos[(2*# + 1)/(2*Pi)] > Cos[1/(2*Pi)]&] (* Vaclav Kotesovec, Feb 15 2019 *) Select[Range[1, 1000], Mod[(2*# + 1)/(2*Pi), 2*Pi] < 1/(2*Pi) || Mod[(2*# + 1)/(2*Pi), 2*Pi] > 2*Pi - 1/(2*Pi) &] (* Vaclav Kotesovec, Feb 15 2019 *) Select[Range[1, 1000], # + 1 > 2*Pi^2*(Floor[#/(2*Pi^2)] + 1) &] (* Vaclav Kotesovec, Feb 15 2019 *) Select[Range[1, 1000], Mod[#, 2*Pi^2] > 2*Pi^2 - 1 &] (* Vaclav Kotesovec, Feb 15 2019 *) PROG (PARI) isok(n) = sum(k=0, n, sin(k/Pi)) < 0; \\ Michel Marcus, Nov 30 2013 CROSSREFS Sequence in context: A041710 A042629 A041708 * A258016 A217731 A195048 Adjacent sequences:  A079041 A079042 A079043 * A079045 A079046 A079047 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 01 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 04:08 EST 2021. Contains 349416 sequences. (Running on oeis4.)