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.

A296357 a(n) = ceiling of n/Pi.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27
Offset: 1

Views

Author

N. J. A. Sloane, Dec 15 2017

Keywords

Comments

The problem asks if a(n) is also equal to ceiling(cosec(Pi/n)) for n>3.
First differs from ceiling(cosec(Pi/n)) for n>3 at n=80143857 (Stadler, 2019; Velleman and Wagon, 2020). - Amiram Eldar, Nov 08 2020

References

  • Daniel J. Velleman and Stan Wagon, Bicycle or Unicycle?, MAA Press, 2020, pp. 32 and 192-194.

Crossrefs

Cf. A032615.

Programs