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-2 of 2 results.

A306610 a(n) = (2*cos(Pi/15))^(-n) + (2*cos(7*Pi/15))^(-n) + (2*cos(11*Pi/15))^(-n) + (2*cos(13*Pi/15))^(-n), for n >= 1.

Original entry on oeis.org

4, 24, 109, 524, 2504, 11979, 57299, 274084, 1311049, 6271254, 29997829, 143491199, 686373809, 3283190949, 15704770004, 75121978804, 359337430474, 1718849676159, 8221921677724, 39328626006254, 188124003629279, 899869747188249, 4304424455586134
Offset: 1

Views

Author

Greg Dresden, Feb 28 2019

Keywords

Comments

-a(n) is the coefficient of x in the minimal polynomial for (2*cos(Pi/15))^n, for n >= 1. The coefficients of -x^3 are A306603(n), and those of x^2 are A306611(n).
a(n) is obtained from the Girard-Waring formula for the sum of powers of N = 4 indeterminates (see A324602), with the elementary symmetric functions e_1 = 4, e_2 = -4, e_3 = -1 and e_4 = 1. The arguments are e_j(1/x_1, 1/x_2, 1/x_3, 1/x_4), for j = 1..4, with the zeros {x_i}{i=1..4} of the minimal polynomial of 2*cos(Pi/15), appearing under the negative powers of the formula given above. - _Wolfdieter Lang, May 08 2019

Links

Crossrefs

Cf. A019887 (cos(Pi/15)), A019815 (cos(7*Pi/15)), A019851 (cos(11*Pi/15)), A019875 (cos(13*Pi/15)), A306603 (positive powers of these cosines), A306611, A324602.

Programs

  • Mathematica
    Table[Round[N[Sum[(2 Cos[k Pi/15])^(-n), {k,{1,7,11,13}}],50]],{n,1,30}]

Formula

a(n) = 4a(n-1) + 4a(n-2) - a(n-3) - a(n-4).
G.f.: x*(-4x^3 -3x^2 +8x +4)/(x^4 +x^3 -4x^2 -4x +1).
a(n) = round((2*cos(7*Pi/15))^(-n)) for n >= 3.

A307886 Array of coefficients of the minimal polynomial of (2*cos(Pi/15))^n, for n >= 1 (ascending powers).

Original entry on oeis.org

1, -4, -4, 1, 1, 1, -24, 26, -9, 1, 1, -109, -49, 1, 1, 1, -524, 246, -29, 1, 1, -2504, -619, -4, 1, 1, -11979, 2621, -99, 1, 1, -57299, -7774, -34, 1, 1, -274084, 30126, -349, 1, 1, -1311049, -97879, -179, 1, 1, -6271254, 363131, -1254, 1, 1, -29997829, -1237504, -824, 1
Offset: 1

Views

Author

Greg Dresden and Wolfdieter Lang, May 02 2019

Keywords

Comments

The length of each row is 5.
The minimal polynomial of (2*cos(Pi/15))^n, for n >= 1, is C(15, n, x) = Product_{j=0..3} (x - (x_j)^n) = Sum_{k=0} T(n, k) x^k, where x_0 = 2*cos(Pi/15), x_1 = 2*cos(7*Pi/15), x_2 = 2*cos(11*Pi/15), and x_3 = 2*cos(13*Pi/15) are the zeros of C(15, 1, x) with coefficients given in A187360 (row n=15).

Examples

			The rectangular array T(n, k) begins:
n\k 0      1      2      3      4
---------------------------------
1:  1     -4     -4      1      1
2:  1    -24     26     -9      1
3:  1   -109    -49      1      1
4:  1   -524    246    -29      1
5:  1  -2504   -619     -4      1
6:  1 -11979   2621    -99      1
7:  1 -57299  -7774    -34      1
...

Crossrefs

Cf. A019887 (cos(Pi/15)), A019815 (cos(7*Pi/15)), A019851 (cos(11*Pi/15)), A019875 (cos(13*Pi/15)), A187360, A306603, A306610, A306611.

Programs

  • Mathematica
    Flatten[Table[CoefficientList[MinimalPolynomial[(2*Cos[\[Pi]/15])^n, x], x], {n, 1, 15}]]

Formula

T(n,k) = the coefficient of x^k in C(15, n, x), n >= 1, k=0,1,2,3,4, with C(15, n, k) the minimal polynomial of (2*cos(Pi/15))^n, for n >= 1 as defined above.
T(n, 0) = T(n, 4) = 1. T(n, 1) = -A306610(n), T(n, 2) = A306611(n), T(n, 3) = -A306603(n), n >= 1.
Showing 1-2 of 2 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.