This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126565 a(n) = ceiling(sin(n)*cos(n)). 1
 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS For all nonzero integers n, ceiling(sin(n)*cos(n)) = 1 + floor(sin(n)*cos(n)), so a(n) = 1 + A126564(n) for n > 0 (a(0) = A126564(0) = 0). LINKS FORMULA a(n) = ceiling(sin(n)*cos(n)). PROG (PARI) a(n) = ceil(sin(n)*cos(n)) CROSSREFS Cf. A126564. Sequence in context: A163584 A286655 A272170 * A215531 A305386 A174998 Adjacent sequences:  A126562 A126563 A126564 * A126566 A126567 A126568 KEYWORD nonn AUTHOR Rick L. Shepherd, Dec 27 2006 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 October 23 22:42 EDT 2019. Contains 328378 sequences. (Running on oeis4.)