cp's OEIS Frontend

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.

A037448 a(n) = floor(cot(n)).

Original entry on oeis.org

0, -1, -8, 0, -1, -4, 1, -1, -3, 1, -1, -2, 2, 0, -2, 3, 0, -1, 6, 0, -1, 112, 0, -1, -8, 0, -1, -4, 1, -1, -3, 1, -1, -2, 2, 0, -2, 3, 0, -1, 6, 0, -1, 56, 0, -1, -9, 0, -1, -4, 1, -1, -3, 1, -1, -2, 2, 0, -2, 3, 0, -1, 5, 0, -1, 37, 0, -1, -9, 0, -1, -4, 1, -1, -3, 1, -1, -2, 2, 0, -2, 3, 0, -1, 5, 0, -1, 28, 0, -1, -10, 0, -1, -4, 1, -1, -3
Offset: 1

Views

Author

Jason Earls, Jun 30 2001

Keywords

Comments

Contains all integers infinitely often. - Charles R Greathouse IV, Aug 06 2012

Crossrefs

Programs

  • Magma
    [Floor(Cot(n)): n in [1..100]]; // Vincenzo Librandi, Jun 15 2015
  • Mathematica
    Floor[Cot[Range[100]]] (* Harvey P. Dale, Dec 26 2024 *)
  • PARI
    v=[]; for(n=1,260,v=concat(v,floor(cotan(n)))); v
    

Extensions

a(44) corrected by T. D. Noe, Jan 21 2008