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.

A000503 a(n) = floor(tan(n)).

Original entry on oeis.org

0, 1, -3, -1, 1, -4, -1, 0, -7, -1, 0, -226, -1, 0, 7, -1, 0, 3, -2, 0, 2, -2, 0, 1, -3, -1, 1, -4, -1, 0, -7, -1, 0, -76, -1, 0, 7, -1, 0, 3, -2, 0, 2, -2, 0, 1, -3, -1, 1, -4, -1, 0, -7, -1, 0, -46, -1, 0, 8, -1, 0, 3, -2, 0, 2, -2, 0, 1, -3, -1, 1, -4, -1, 0, -6, -1, 0, -33, -1, 0, 9, -1, 0, 3, -2, 0, 2, -2, 0, 1, -2, -1, 1, -3, -1, 0, -6, -1, 0, -26
Offset: 0

Views

Author

Keywords

Comments

Every integer appears infinitely often. - Charles R Greathouse IV, Aug 06 2012
Does not satisfy Benford's law [Whyman et al., 2016]. - N. J. A. Sloane, Feb 12 2017

Crossrefs

Programs

Extensions

More terms from Stefan Steinerberger, Apr 09 2006