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.

A005699 a(n) = ceiling(tan(n)^2).

Original entry on oeis.org

0, 3, 5, 1, 2, 12, 1, 1, 47, 1, 1, 51054, 1, 1, 53, 1, 1, 13, 2, 1, 6, 3, 1, 3, 5, 1, 2, 11, 1, 1, 42, 1, 1, 5673, 1, 1, 61, 1, 1, 14, 2, 1, 6, 3, 1, 3, 5, 1, 2, 11, 1, 1, 37, 1, 1, 2042, 1, 1, 70, 1, 1, 15, 2, 1, 6, 3, 1, 3, 5, 1, 2, 10, 1, 1, 33, 1, 1, 1042, 1, 1, 82, 1, 1, 16, 2, 1, 6, 3, 1, 3, 4, 1, 2, 9, 1, 1, 30, 1, 1, 630, 1, 1, 96, 1, 1, 17
Offset: 0

Views

Author

Keywords

Comments

For n > 0, a(n) = floor(sec(n)^2). - N. J. A. Sloane, Mar 17 2025

Crossrefs

Programs

Extensions

More terms from Seiichi Manyama, Feb 28 2024