The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266800 Coefficient of x in the minimal polynomial of the continued fraction [1^n,sqrt(3),1,1,...], where 1^n means n ones. 5
-8, -12, -98, -636, -4424, -30138, -207032, -1417788, -9720866, -66619404, -456638168, -3129787002, -21452029928, -147034005996, -1007787102434, -6907472856348, -47344530365672, -324504220137018, -2224185061818776, -15244791078484764, -104489352838678178 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
See A265762 for a guide to related sequences.
LINKS
FORMULA
a(n) = 5*a(n-1) + 15*a(n-2) - 15*a(n-3) - 5*a(n-4) + a(n-5) .
G.f.: -((2 (-4 + 14 x + 41 x^2 - 43 x^3 + 3 x^4))/(-1 + 5 x + 15 x^2 - 15 x^3 - 5 x^4 + x^5)).
EXAMPLE
Let p(n,x) be the minimal polynomial of the number given by the n-th continued fraction:
[sqrt(3),1,1,1,...] has p(0,x)=1-8x-7x^2+2x^3+x^4, so a(0) = -8;
[1,sqrt(3),1,1,1,...] has p(1,x)=1-12x+23x^2-12x^3+x^4, so a(1) = -12;
[1,1,sqrt(3),1,1,1...] has p(2,x)=49-98x+65x^2-16x^3+x^4, so a(2) = -98.
MATHEMATICA
u[n_] := Table[1, {k, 1, n}]; t[n_] := Join[u[n], {Sqrt[3]}, {{1}}];
f[n_] := FromContinuedFraction[t[n]];
t = Table[MinimalPolynomial[f[n], x], {n, 0, 40}];
Coefficient[t, x, 0] ; (* A266799 *)
Coefficient[t, x, 1]; (* A266800 *)
Coefficient[t, x, 2]; (* A266801 *)
Coefficient[t, x, 3]; (* A266802 *)
Coefficient[t, x, 4]; (* A266799 *)
CROSSREFS
Sequence in context: A226259 A162466 A098664 * A230545 A180922 A083128
KEYWORD
sign,easy
AUTHOR
Clark Kimberling, Jan 09 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 12:26 EDT 2024. Contains 372600 sequences. (Running on oeis4.)