A040012 -id:A040012 - cp's OEIS frontend

A040000 a(0)=1; a(n)=2 for n >= 1.

1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset: 0

N. J. A. Sloane, Dec 11 1999

Continued fraction expansion of sqrt(2) is 1 + 1/(2 + 1/(2 + 1/(2 + ...))).
Inverse binomial transform of Mersenne numbers A000225(n+1) = 2^(n+1) - 1. - Paul Barry, Feb 28 2003
A Chebyshev transform of 2^n: if A(x) is the g.f. of a sequence, map it to ((1-x^2)/(1+x^2))A(x/(1+x^2)). - Paul Barry, Oct 31 2004
An inverse Catalan transform of A068875 under the mapping g(x)->g(x(1-x)). A068875 can be retrieved using the mapping g(x)->g(xc(x)), where c(x) is the g.f. of A000108. A040000 and A068875 may be described as a Catalan pair. - Paul Barry, Nov 14 2004
Sequence of electron arrangement in the 1s 2s and 3s atomic subshells. Cf. A001105, A016825. - Jeremy Gardiner, Dec 19 2004
Binomial transform of A165326. - Philippe Deléham, Sep 16 2009
Let m=2. We observe that a(n) = Sum_{k=0..floor(n/2)} binomial(m,n-2*k). Then there is a link with A113311 and A115291: it is the same formula with respectively m=3 and m=4. We can generalize this result with the sequence whose g.f. is given by (1+z)^(m-1)/(1-z). - Richard Choulet, Dec 08 2009
With offset 1: number of permutations where |p(i) - p(i+1)| <= 1 for n=1,2,...,n-1. This is the identical permutation and (for n>1) its reversal.
Equals INVERT transform of bar(1, 1, -1, -1, ...).
Eventual period is (2). - Zak Seidov, Mar 05 2011
Also decimal expansion of 11/90. - Vincenzo Librandi, Sep 24 2011
a(n) = 3 - A054977(n); right edge of the triangle in A182579. - Reinhard Zumkeller, May 07 2012
With offset 1: minimum cardinality of the range of a periodic sequence with (least) period n. Of course the range's maximum cardinality for a purely periodic sequence with (least) period n is n. - Rick L. Shepherd, Dec 08 2014
With offset 1: n*a(1) + (n-1)*a(2) + ... + 2*a(n-1) + a(n) = n^2. - Warren Breslow, Dec 12 2014
With offset 1: decimal expansion of gamma(4) = 11/9 where gamma(n) = Cp(n)/Cv(n) is the n-th Poisson's constant. For the definition of Cp and Cv see A272002. - Natan Arie Consigli, Sep 11 2016
a(n) equals the number of binary sequences of length n where no two consecutive terms differ. Also equals the number of binary sequences of length n where no two consecutive terms are the same. - David Nacin, May 31 2017
a(n) is the period of the continued fractions for sqrt((n+2)/(n+1)) and sqrt((n+1)/(n+2)). - A.H.M. Smeets, Dec 05 2017
Also, number of self-avoiding walks and coordination sequence for the one-dimensional lattice Z. - Sean A. Irvine, Jul 27 2020

			sqrt(2) = 1.41421356237309504... = 1 + 1/(2 + 1/(2 + 1/(2 + 1/(2 + ...)))). - _Harry J. Smith_, Apr 21 2009
G.f. = 1 + 2*x + 2*x^2 + 2*x^3 + 2*x^4 + 2*x^5 + 2*x^6 + 2*x^7 + 2*x^8 + ...
11/90 = 0.1222222222222222222... - _Natan Arie Consigli_, Sep 11 2016

A. Beiser, Concepts of Modern Physics, 2nd Ed., McGraw-Hill, 1973.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 186.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §4.4 Powers and Roots, p. 144.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 276-278.

Harry J. Smith, Table of n, a(n) for n = 0..20000
Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.
Bruce Fang, Pamela E. Harris, Brian M. Kamau, and David Wang, Vacillating parking functions, arXiv:2402.02538 [math.CO], 2024.
Kshitij Education, Molar specific heat.
MathPath, Square-roots via Continued Fractions.
Narad Rampersad and Max Wiebe, Sums of products of binomial coefficients mod 2 and 2-regular sequences, arXiv:2309.04012 [math.NT], 2023.
Eric Weisstein's World of Mathematics, Square root.
Eric Weisstein's World of Mathematics, Pythagoras's Constant.
Wikipedia, Poisson's constant.
G. Xiao, Contfrac.
Index entries for continued fractions for constants.
Index entries for eventually constant sequences.
Index to divisibility sequences.
Index entries for linear recurrences with constant coefficients, signature (1).

Convolution square is A008574.
See A003945 etc. for (1+x)/(1-k*x).
From Jaume Oliver Lafont, Mar 26 2009: (Start)
Sum_{0<=k<=n} a(k) = A005408(n).
Prod_{0<=k<=n} a(k) = A000079(n). (End)
Cf. A113311, A115291, A171418, A171440, A171441, A171442, A171443.
Cf. A000674 (boustrophedon transform).
Cf. A001333/A000129 (continued fraction convergents).
Cf. A000122, A002193 (sqrt(2) decimal expansion), A006487 (Egyptian fraction).
Cf. Other continued fractions for sqrt(a^2+1) = (a, 2a, 2a, 2a....): A040002 (contfrac(sqrt(5)) = (2,4,4,...)), A040006, A040012, A040020, A040030, A040042, A040056, A040072, A040090, A040110 (contfrac(sqrt(122)) = (11,22,22,...)), A040132, A040156, A040182, A040210, A040240, A040272, A040306, A040342, A040380, A040420 (contfrac(sqrt(442)) = (21,42,42,...)), A040462, A040506, A040552, A040600, A040650, A040702, A040756, A040812, A040870, A040930 (contfrac(sqrt(962)) = (31,62,62,...)).

a040000 0 = 1; a040000 n = 2
a040000_list = 1 : repeat 2  -- Reinhard Zumkeller, May 07 2012

Digits := 100: convert(evalf(sqrt(2)),confrac,90,'cvgts'):

ContinuedFraction[Sqrt[2],300] (* Vladimir Joseph Stephan Orlovsky, Mar 04 2011 *)
a[ n_] := 2 - Boole[n == 0]; (* Michael Somos, Dec 28 2014 *)
PadRight[{1},120,2] (* or *) RealDigits[11/90, 10, 120][[1]] (* Harvey P. Dale, Jul 12 2025 *)

{a(n) = 2-!n}; /* Michael Somos, Apr 16 2007 */

a(n)=1+sign(n)  \\ Jaume Oliver Lafont, Mar 26 2009

allocatemem(932245000); default(realprecision, 21000); x=contfrac(sqrt(2)); for (n=0, 20000, write("b040000.txt", n, " ", x[n+1]));  \\ Harry J. Smith, Apr 21 2009

G.f.: (1+x)/(1-x). - Paul Barry, Feb 28 2003
a(n) = 2 - 0^n; a(n) = Sum_{k=0..n} binomial(1, k). - Paul Barry, Oct 16 2004
a(n) = n*Sum_{k=0..floor(n/2)} (-1)^k*binomial(n-k, k)*2^(n-2*k)/(n-k). - Paul Barry, Oct 31 2004
A040000(n) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*(-1)^k*A068875(n-k). - Paul Barry, Nov 14 2004
From Michael Somos, Apr 16 2007: (Start)
Euler transform of length 2 sequence [2, -1].
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = (u-v)*(u+v) - 2*v*(u-w).
E.g.f.: 2*exp(x) - 1.
a(n) = a(-n) for all n in Z (one possible extension to n<0). (End)
G.f.: (1-x^2)/(1-x)^2. - Jaume Oliver Lafont, Mar 26 2009
G.f.: exp(2*atanh(x)). - Jaume Oliver Lafont, Oct 20 2009
a(n) = Sum_{k=0..n} A108561(n,k)*(-1)^k. - Philippe Deléham, Nov 17 2013
a(n) = 1 + sign(n). - Wesley Ivan Hurt, Apr 16 2014
10 * 11/90 = 11/9 = (11/2 R)/(9/2 R) = Cp(4)/Cv(4) = A272005/A272004, with R = A081822 (or A070064). - Natan Arie Consigli, Sep 11 2016
a(n) = A001227(A000040(n+1)). - Omar E. Pol, Feb 28 2018

A040002 Continued fraction for sqrt(5).

Original entry on oeis.org

2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4

Offset: 0

N. J. A. Sloane

Decimal expansion of 11/45. - Natan Arie Consigli, Jan 19 2016

			2.236067977499789696409173668... = 2 + 1/(4 + 1/(4 + 1/(4 + 1/(4 + ...)))). - _Harry J. Smith_, Jun 01 2009

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 186.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 276.

Harry J. Smith, Table of n, a(n) for n = 0..20000
G. Xiao, Contfrac
Index entries for continued fractions for constants
Index of eventually constant sequences
Index of divisibility sequences
Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A002163 (decimal expansion), A001077/A001076 (convergents), A248235 (Egyptian fraction).
Cf. Continued fraction for sqrt(a^2+1) = (a, 2a, 2a, 2a....): A040000 (contfrac(sqrt(2)) = (1,2,2,...)), A040002, A040006, A040012, A040020, A040030, A040042, A040056, A040072, A040090, A040110 (contfrac(sqrt(122)) = (11,22,22,...)), A040132, A040156, A040182, A040210, A040240, A040272, A040306, A040342, A040380, A040420 (contfrac(sqrt(442)) = (21,42,42,...)), A040462, A040506, A040552, A040600, A040650, A040702, A040756, A040812, A040870, A040930 (contfrac(sqrt(962)) = (31,62,62,...)).
Essentially the same as A010709.

Digits := 100: convert(evalf(sqrt(N)),confrac,90,'cvgts'):

ContinuedFraction[Sqrt[5],300] (* Vladimir Joseph Stephan Orlovsky, Mar 04 2011 *)
PadRight[{2},120,{4}] (* Harvey P. Dale, Jul 06 2019 *)

{ allocatemem(932245000); default(realprecision, 26000); x=contfrac(sqrt(5)); for (n=0, 20000, write("b040002.txt", n, " ", x[n+1])); } \\ Harry J. Smith, Jun 01 2009

a(0) = 2, a(n) = 4 n>0. - Natan Arie Consigli, Jan 19 2016
From Elmo R. Oliveira, Feb 16 2024: (Start)
G.f.: 2*(1+x)/(1-x).
E.g.f.: 4*exp(x) - 2.
a(n) = 2*A040000(n). (End)

A041025 Denominators of continued fraction convergents to sqrt(17).

Original entry on oeis.org

1, 8, 65, 528, 4289, 34840, 283009, 2298912, 18674305, 151693352, 1232221121, 10009462320, 81307919681, 660472819768, 5365090477825, 43581196642368, 354014663616769, 2875698505576520, 23359602708228929, 189752520171407952, 1541379764079492545

Offset: 0

N. J. A. Sloane

a(2*n+1) with b(2*n+1) := A041024(2*n+1), n >= 0, give all (positive integer) solutions to Pell equation b^2 - 17*a^2 = +1, a(2*n) with b(2*n) := A041024(2*n), n >= 0, give all (positive integer) solutions to Pell equation b^2 - 17*a^2 = -1 (cf. Emerson reference).
Bisection: a(2*n) = T(2*n+1,sqrt(17))/sqrt(17) = A078988(n), n >= 0 and a(2*n+1) = 8*S(n-1,66), n >= 0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second kind. S(-1,x)=0. See A053120, resp. A049310. - Wolfdieter Lang, Jan 10 2003
Sqrt(17) = 8/2 + 8/65 + 8/(65*4289) + 8/(4289*283009) + ... . - Gary W. Adamson, Dec 26 2007
For positive n, a(n) equals the permanent of the n X n tridiagonal matrix with 8's along the main diagonal and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
De Moivre's formula: a(n) = (r^n - s^n)/(r-s), for r > s, gives sequences with integers if r and s are conjugates. With r=4+sqrt(17) and s=4-sqrt(17), a(n+1)/a(n) converges to r=4+sqrt(17). - Sture Sjöstedt, Nov 11 2011
a(n) equals the number of words of length n on alphabet {0,1,...,8} avoiding runs of zeros of odd lengths. - Milan Janjic, Jan 28 2015
From Michael A. Allen, Feb 21 2023: (Start)
Also called the 8-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence.
a(n) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 8 kinds of squares available. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
D. Birmajer, J. B. Gil, and M. D. Weiner, On the Enumeration of Restricted Words over a Finite Alphabet, J. Int. Seq. 19 (2016) # 16.1.3, Example 8.
E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart., 7 (1969), pp. 231-242, Thm. 1, p. 233.
Sergio Falcón and Ángel Plaza, The k-Fibonacci sequence and the Pascal 2-triangle, Chaos, Solitons & Fractals 2007; 33(1): 38-49.
S. Falcón and Á. Plaza, On k-Fibonacci sequences and polynomials and their derivatives, Chaos, Solitons & Fractals (2007).
Milan Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.7.
Tanya Khovanova, Recursive Sequences
Kai Wang, On k-Fibonacci Sequences And Infinite Series List of Results and Examples, 2020.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (8,1).

Cf. A041024, A040012.
Cf. A000045, A000129, A006190, A001076, A052918, A005668, A054413, A243399.
Row n=8 of A073133, A172236 and A352361.
Cf. A099369 (squares).

I:=[1, 8]; [n le 2 select I[n] else 8*Self(n-1)+Self(n-2): n in [1..25]]; // Vincenzo Librandi, Feb 23 2013

CoefficientList[Series[1/(-z^2 - 8 z + 1), {z, 0, 200}], z] (* Vladimir Joseph Stephan Orlovsky, Jun 23 2011 *)
Denominator[Convergents[Sqrt[17],30]] (* Harvey P. Dale, Aug 15 2011 *)
LinearRecurrence[{8,1}, {1,8}, 50] (* Sture Sjöstedt, Nov 11 2011 *)

Vec(1/(1-8*x-x^2)+O(x^99)) \\ Charles R Greathouse IV, Dec 09 2014

[lucas_number1(n,8,-1) for n in range(1, 20)] # Zerinvary Lajos, Apr 25 2009

G.f.: 1/(1 - 8*x - x^2).
a(n) = ((-i)^n)*S(n, 8*i), with S(n, x) := U(n, x/2) Chebyshev's polynomials of the second kind and i^2 = -1. See A049310.
a(n) = F(n, 8), the n-th Fibonacci polynomial evaluated at x=8. - T. D. Noe, Jan 19 2006
From Sergio Falcon, Sep 24 2007: (Start)
a(n) = ((4 + sqrt(17))^n - (4 - sqrt(17))^n)/(2*sqrt(17));
a(n) = Sum_{i=0..floor((n-1)/2)} binomial(n-1-i,i)*8^(n-1-2i). (End)
Let T be the 2 X 2 matrix [0, 1; 1, 8]. Then T^n * [1, 0] = [a(n-2), a(n-1)]. - Gary W. Adamson, Dec 26 2007
a(n) = 8*a(n-1) + a(n-2), n > 1; a(0)=1, a(1)=8. - Philippe Deléham, Nov 20 2008
a(p-1) == 68^((p-1)/2) (mod p) for odd primes p. - Gary W. Adamson, Feb 22 2009 [Corrected by Jason Yuen, Apr 05 2025. See A087475 for more info about this congruence.]
Sum_{n>=0} (-1)^n/(a(n)*a(n+1)) = sqrt(17) - 4. - Vladimir Shevelev, Feb 23 2013
G.f.: x/(1 - 8*x - x^2) = Sum_{n >= 0} x^n *( Product_{k = 1..n} (m*k + 8 - m + x)/(1 + m*k*x) ) for arbitrary m (a telescoping series). - Peter Bala, May 08 2024

A010473 Decimal expansion of square root of 17.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

Continued fraction expansion is 4 followed by {8} repeated. - Harry J. Smith, Jun 05 2009
The spiral of Theodorus is an agglomeration of right triangles each having a hypotenuse with a length that is the square root of an integer. The original spiral stops at sqrt(17). - Alonso del Arte, Apr 30 2015
The fundamental algebraic (integer) number in the field Q(sqrt(17)) is (1 + sqrt(17))/2 = A222132. - Wolfdieter Lang, Nov 21 2023

			4.123105625617660549821409855974077025147199225373620434398633573...

James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 275.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 58.

Harry J. Smith, Table of n, a(n) for n = 1..20000
Elizabeth Nelli, Spiral of Theodorus.
Index entries for algebraic numbers, degree 2.

Cf. A040012 (continued fraction), A222132.

RealDigits[N[Sqrt[17], 100]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 21 2011 *)

default(realprecision, 20080); x=sqrt(17); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b010473.txt", n, " ", d));  \\ Harry J. Smith, Jun 03 2009

A040056 Continued fraction for sqrt(65).

Original entry on oeis.org

8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16

Offset: 0

N. J. A. Sloane

			8.06225774829854965236661... = 8 + 1/(16 + 1/(16 + 1/(16 + 1/(16 + ...)))).

Harry J. Smith, Table of n, a(n) for n = 0..20000
G. Xiao, Contfrac
Index entries for continued fractions for constants
Index to divisibility sequences
Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A010517 (decimal expansion), A041112/A041113 (convergents), A248289 (Egyptian fraction).

Cf. A040000, A040002, A040012.

Digits := 100: convert(evalf(sqrt(N)),confrac,90,'cvgts'):

ContinuedFraction[Sqrt[65],300] (* Vladimir Joseph Stephan Orlovsky, Mar 08 2011 *)
PadRight[{8},120,{16}] (* Harvey P. Dale, Nov 27 2020 *)

{ allocatemem(932245000); default(realprecision, 49000); x=contfrac(sqrt(65)); for (n=0, 20000, write("b040056.txt", n, " ", x[n+1])); } \\ Harry J. Smith, Jun 07 2009

From Elmo R. Oliveira, Feb 10 2024: (Start)
a(n) = 16 = A010855(n) for n >= 1.
G.f.: 8*(1+x)/(1-x).
E.g.f.: 16*exp(x) - 8.
a(n) = 8*A040000(n) = 4*A040002(n) = 2*A040012(n). (End)

A041024 Numerators of continued fraction convergents to sqrt(17).

Original entry on oeis.org

4, 33, 268, 2177, 17684, 143649, 1166876, 9478657, 76996132, 625447713, 5080577836, 41270070401, 335241141044, 2723199198753, 22120834731068, 179689877047297, 1459639851109444, 11856808685922849, 96314109338492236

Offset: 0

N. J. A. Sloane

a(2*n+1) with b(2*n+1) := A041025(2*n+1), n >= 0, give all (positive integer) solutions to Pell equation a^2 - 17*b^2 = +1, a(2*n) with b(2*n) := A041025(2*n), n >= 1, give all (positive integer) solutions to Pell equation a^2 - 17*b^2 = -1 (cf. Emerson reference).

Bisection: a(2*n) = 4*S(2*n,2*sqrt(17)) = 4*A078989(n), n >= 0 and a(2*n+1) = T(n+1,33), n >= 0, with S(n,x), resp. T(n,x), Chebyshev's polynomials of the second, resp. first kind. See A049310, resp. A053120. - Wolfdieter Lang, Jan 10 2003

Vincenzo Librandi, Table of n, a(n) for n = 0..200
E. I. Emerson, Recurrent sequences in the equation DQ^2=R^2+N, Fib. Quart., 7 (1969), 231-242, Thm. 1, p. 233.
Tanya Khovanova, Recursive Sequences
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (8,1).

Cf. A010473, A040012, A041025.

Table[Numerator[FromContinuedFraction[ContinuedFraction[Sqrt[17],n]]],{n,1,50}] (* Vladimir Joseph Stephan Orlovsky, Mar 17 2011*)
LinearRecurrence[{8, 1}, {4, 33}, 25] (* Sture Sjöstedt, Dec 07 2011 *)
CoefficientList[Series[(4 + x)/(1 - 8 x - x^2), {x, 0, 30}], x]  (* Vincenzo Librandi_, Oct 28 2013 *)

G.f.: (4+x)/(1-8*x-x^2).
a(n) = 4*A041025(n) + A041025(n-1).
a(n) = ((-i)^(n+1))*T(n+1, 4*i) with T(n, x) Chebyshev's polynomials of the first kind (see A053120) and i^2 = -1.
a(n) = 8*a(n-1) + a(n-2), n > 1. - Philippe Deléham, Nov 20 2008
a(n) = ((4 + sqrt(17))^n + (4 - sqrt(17))^n)/2. - Sture Sjöstedt, Dec 08 2011

A040380 Continued fraction for sqrt(401).

Original entry on oeis.org

20, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40

Offset: 0

N. J. A. Sloane

			20 + 1/(40 + 1/(40 + 1/(40 + 1/(40 + ...)))) = sqrt(401).

Cf. A041760/A041761 (convergents).

Cf. A040000, A040002, A040012.

with(numtheory): Digits := 300: convert(evalf(sqrt(401)),confrac);

From Elmo R. Oliveira, Feb 15 2024: (Start)
a(n) = 40 for n >= 1.
G.f.: 20*(1+x)/(1-x).
E.g.f.: 40*exp(x) - 20.
a(n) = 20*A040000(n) = 10*A040002(n) = 5*A040012(n). (End)

A040756 Continued fraction for sqrt(785).

Original entry on oeis.org

28, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56

Offset: 0

N. J. A. Sloane

			28 + 1/(56 + 1/(56 + 1/(56 + 1/(56 + ...)))) = sqrt(785).

Cf. A042512/A042513 (convergents).

Cf. A040000, A040002, A040012.

with(numtheory): Digits := 300: convert(evalf(sqrt(785)),confrac);

Block[{$MaxExtraPrecision =1000},ContinuedFraction[Sqrt[785],70]] (* or *) PadRight[{28},70,56] (* Harvey P. Dale, May 09 2012 *)

From Elmo R. Oliveira, Feb 16 2024: (Start)
a(n) = 56 for n >= 1.
G.f.: 28*(1+x)/(1-x).
E.g.f.: 56*exp(x) - 28.
a(n) = 28*A040000(n) = 14*A040002(n) = 7*A040012(n). (End)

A099370 Chebyshev polynomial of the first kind, T(n,x), evaluated at x=33.

Original entry on oeis.org

1, 33, 2177, 143649, 9478657, 625447713, 41270070401, 2723199198753, 179689877047297, 11856808685922849, 782369683393860737, 51624542295308885793, 3406437421806992601601, 224773245296966202819873

Offset: 0

Wolfdieter Lang, Oct 18 2004

Used in A099369.
Solutions of the Pell equation x^2 - 17y^2 = 1 (x values). After initial term this sequence bisects A041024. See 8*A097316(n-1) with A097316(-1) = 0 for corresponding y values. a(n+1)/a(n) apparently converges to (4+sqrt(17))^2. (See related comments in A088317, which this sequence also bisects.). - Rick L. Shepherd, Jul 31 2006
From a(n) = T(n, 33) (see the formula section) and the de Moivre-Binet formula for T(n,x=33) follows a(n+1)/a(n) = 33  + 8*sqrt(17), which is the conjectured value (4+sqrt(17))^2 given in the previous comment by Rick L. Shepherd. - Wolfdieter Lang, Jun 28 2013
Also numbers k such that 17*(k-1)*(k+1) is a square. - Bruno Berselli, May 31 2025

			a(1)^2 - 17*A121470(1)^2 = 33^2 - 17*8^2 = 1089 - 1088 = 1.

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, Ellipse Chains and Associated Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Pell Equation
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (66,-1).

Cf. A121470, A041024, A040012.

Row 4 of array A188645.

LinearRecurrence[{66, -1},{1, 33},14] (* Ray Chandler, Aug 11 2015 *)

\\ Program uses fact that continued fraction for sqrt(17) = [4,8,8,...].
print1("1, "); forstep(n=2,40,2,v=vector(n,i,if(i>1,8,4)); print1(contfracpnqn(v)[1,1],", ")) \\ Rick L. Shepherd, Jul 31 2006

vector(20,n,polchebyshev(n-1,1,33)) \\ Joerg Arndt, Jan 01 2021

a(n) = 66*a(n-1) - a(n-2), a(-1):= 33, a(0)=1.
a(n) = T(n, 33) = (S(n, 66)-S(n-2, 66))/2 = S(n, 66)-33*S(n-1, 66) with T(n, x), resp. S(n, x), Chebyshev polynomials of the first, resp.second, kind. See A053120 and A049310. S(n, 66) = A097316(n).
a(n) = ((33+8*sqrt(17))^n + (33-8*sqrt(17))^n)/2.
a(n) = Sum_{k=0..floor(n/2)} ((-1)^k)*(n/(2*(n-k)))*binomial(n-k, k)*(2*33)^(n-2*k), for n>=1, a(0)=1.
G.f.: (1-33*x)/(1-66*x+x^2).

A-number for y values in Pell equation corrected by Wolfdieter Lang, Jun 28 2013

A040240 Continued fraction for sqrt(257).

Original entry on oeis.org

16, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32

Offset: 0

N. J. A. Sloane

			16 + 1/(32 + 1/(32 + 1/(32 + 1/(32 + ...)))) = sqrt(257).

Cf. A041480/A041481 (convergents).

Cf. A040000, A040002, A040012, A040056.

with(numtheory): Digits := 300: convert(evalf(sqrt(257)),confrac);

Block[{$MaxExtraPrecision=1000}, ContinuedFraction[Sqrt[257],100]] (* or *) PadRight[{16},100,{32}] (* Harvey P. Dale, Aug 15 2021 *)

a(n)=if(n,32,16) \\ Charles R Greathouse IV, Apr 08 2012

From Elmo R. Oliveira, Feb 13 2024: (Start)
a(n) = 32 for n >= 1.
G.f.: 16*(1+x)/(1-x).
E.g.f.: 32*exp(x) - 16.
a(n) = 16*A040000(n) = 8*A040002(n) = 4*A040012(n) = 2*A040056(n). (End)

cp's OEIS Frontend

A040000 a(0)=1; a(n)=2 for n >= 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Formula

A040002 Continued fraction for sqrt(5).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A041025 Denominators of continued fraction convergents to sqrt(17).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A010473 Decimal expansion of square root of 17.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

A040056 Continued fraction for sqrt(65).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A041024 Numerators of continued fraction convergents to sqrt(17).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A040380 Continued fraction for sqrt(401).