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.

A376455 a(n) = least k such that n^(2k+1)/(2k+1)! < 1.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 7, 8, 10, 11, 12, 14, 15, 16, 18, 19, 20, 22, 23, 24, 26, 27, 28, 30, 31, 32, 34, 35, 36, 38, 39, 41, 42, 43, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 61, 62, 64, 65, 66, 68, 69, 70, 72, 73, 74, 76, 77, 78, 80, 81, 83, 84, 85, 87, 88
Offset: 0

Views

Author

Clark Kimberling, Oct 17 2024

Keywords

Comments

The numbers n^(2k+1)/(2k+1)! are the coefficients in the Maclaurin series for sin x when x = 1. If m>a(n), then n^(2k+1)/(2k+1)! < 1.

Crossrefs

Programs

  • Mathematica
    a[n_] := Select[Range[z], n^(2 # + 1)/(2 # + 1)! < 1 &, 1]
    Flatten[Table[a[n], {n, 0, 100}]]