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.

Showing 1-3 of 3 results.

A332326 Decimal expansion of the least positive zero of the 4th Maclaurin polynomial of cos x.

Original entry on oeis.org

1, 5, 9, 2, 4, 5, 0, 4, 3, 4, 0, 3, 6, 2, 5, 1, 3, 8, 1, 6, 6, 8, 9, 9, 8, 6, 7, 0, 4, 8, 4, 0, 0, 1, 9, 6, 9, 6, 5, 9, 5, 5, 0, 5, 6, 2, 7, 0, 7, 2, 2, 1, 7, 1, 8, 2, 1, 7, 6, 8, 6, 4, 5, 5, 1, 7, 7, 5, 6, 6, 8, 0, 7, 6, 2, 1, 2, 2, 5, 3, 4, 1, 3, 2, 9, 1
Offset: 1

Views

Author

Clark Kimberling, Feb 11 2020

Keywords

Comments

The Maclaurin polynomial p(2n,x) of cos x is 1 - x^2/2! + x^4/4! + ... + (-1)^n ^(2n)/(2n)!.
Let z(n) be the least positive zero of p(2n,x). The limit of z(n) is Pi/2 = 1.570796326..., as in A019669.

Examples

			Least positive zero = 1.592450434036251381668998670484001969...

Crossrefs

Cf. A019669, A332325, A332327, A323328, A323329.

Programs

  • Mathematica
    z = 150; p[n_, x_] := Normal[Series[Cos[x], {x, 0, n}]]
t = x /. NSolve[p[4, x] == 0, x, z][[3]]
u = RealDigits[t][[1]]
Plot[Evaluate[p[4, x]], {x, -1, 4}]

A332420 Number of Maclaurin polynomials p(2m-1,x) of sin(x) having exactly n positive zeros.

Original entry on oeis.org

3, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 4, 4, 5, 4, 4, 5, 4
Offset: 1

Views

Author

Clark Kimberling, Feb 13 2020

Keywords

Comments

Maclaurin polynomial p(2m-1,x) of sin(x) is x - x^3/3! + x^5/5! - ... - (-1)^m*x^(2m-1)/(2m-1)!.

Examples

			a(1) counts these values of 2m-1: 3, 5, and 11. The single zeros of p(3,x), p(5,x), and p(11,x) are sqrt(6), 3.078642..., and 3.141148..., respectively.

Crossrefs

Cf. A012265, A332325.

Programs

  • Mathematica
    z = 60; p[n_, x_] := Normal[Series[Sin[x], {x, 0, n}]];
t[n_] := x /. NSolve[p[n, x] == 0, x, z];
u[n_] := Select[t[n], Im[#] == 0 && # > 0 &];
v = Table[Length[u[n]], {n, 2, 100, 2}]
Table[Count[v, n], {n, 1, 10}]

Extensions

More terms from Jinyuan Wang, Jan 21 2025

A358997 a(n) is the number of distinct positive real roots of the Maclaurin polynomial of degree 2*n for cos(x).

Original entry on oeis.org

0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 10, 9, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 13, 12, 13, 14, 13, 14, 13, 14, 15, 14, 15, 14, 15, 16, 15, 16, 17, 16, 17, 16, 17, 18, 17, 18, 19, 18, 19, 18, 19, 20, 19, 20, 19, 20, 21
Offset: 0

Views

Author

Robert Israel, Dec 09 2022

Keywords

Comments

It appears that a(n) == n (mod 2) and a(n+2) - a(n) is always either 0 or 2.

Examples

			a(2) = 2 because the Maclaurin polynomial of degree 4, 1 - x^2/2! + x^4/4!, has two distinct nonnegative real roots, namely sqrt(6-2*sqrt(3)) and sqrt(6+2*sqrt(3)).

Links

Crossrefs

Cf. A012265, A332325.

Programs

  • Maple
    f:= proc(n) local p, k;
  p:= add((-1)^k * x^k/(2*k)!, k=0..n);
  sturm(sturmseq(p,x),x,0,infinity)
end proc:
map(f, [$0..100]);
  • Mathematica
    a[n_] := CountRoots[Sum[(-1)^k*x^k/(2k)!, {k, 0, n}], {x, 0, Infinity}];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 12 2023 *)
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.