A040042 -id:A040042 - 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

A010503 Decimal expansion of 1/sqrt(2).

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane

The decimal expansion of sqrt(50) = 5*sqrt(2) = 7.0710678118654752440... gives essentially the same sequence.
Also real and imaginary part of the square root of the imaginary unit. - Alonso del Arte, Jan 07 2011
1/sqrt(2) = (1/2)^(1/2) = (1/4)^(1/4) (see the comments in A072364).
If a triangle has sides whose lengths form a harmonic progression in the ratio 1 : 1/(1 + d) : 1/(1 + 2d) then the triangle inequality condition requires that d be in the range -1 + 1/sqrt(2) < d < 1/sqrt(2). - Frank M Jackson, Oct 11 2011
Let s_2(n) be the sum of the base-2 digits of n and epsilon(n) = (-1)^s_2(n), the Thue-Morse sequence A010060, then Product_{n >= 0} ((2*n + 1)/(2*n + 2))^epsilon(n) = 1/sqrt(2). - Jonathan Vos Post, Jun 03 2012
The square root of 1/2 and thus it follows from the Pythagorean theorem that it is the sine of 45 degrees (and the cosine of 45 degrees). - Alonso del Arte, Sep 24 2012
Circumscribed sphere radius for a regular octahedron with unit edges. In electrical engineering, ratio of effective amplitude to peak amplitude of an alternating current/voltage. - Stanislav Sykora, Feb 10 2014
Radius of midsphere (tangent to edges) in a cube with unit edges. - Stanislav Sykora, Mar 27 2014
Positive zero of the Hermite polynomial of degree 2. - A.H.M. Smeets, Jun 02 2025

			0.7071067811865475...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, Sections 1.1, 7.5.2, and 8.2, pp. 1-3, 468, 484, 487.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §12.4 Theorems and Formulas (Solid Geometry), p. 450.

Harry J. Smith, Table of n, a(n) for n = 0..20000
P. C. Fishburn and J. A. Reeds, Bell inequalities, Grothendieck's constant and root two, SIAM J. Discrete Math., Vol. 7, No. 1, Feb. 1994, pp. 48-56.
Ovidiu Furdui, Problem 1, Problem Corner, Research Group in Mathematical Inequalities and Applications, 2010.
Michael Penn, A surprisingly convergent limit, YouTube video, 2022.
Michael Penn, The infinite fraction of your dreams (nightmare?), YouTube video, 2022.
Jonathan Sondow and D. Marques, Algebraic and transcendental solutions of some exponential equations, Annales Mathematicae et Informaticae 37 (2010) 151-164; arXiv:1108.6096 [math.NT], 2011, see p. 3 in the link.
Eric Weisstein's World of Mathematics, Digit Product.
Wikipedia, Platonic solid.
Donald R. Woods, Problem E 2692, Elementary Problems, The American Mathematical Monthly, Vol. 85, No. 1 (1978), p. 48; A Transcendental Function Satisfy a Duplication Formula, by David Robbins, ibid., Vol. 86, No. 5 (1979), pp. 394-395.
Index entries for algebraic numbers, degree 2.

Cf. A000120, A040042, A072364, A268682.
Cf. A073084 (infinite tetration limit).
Platonic solids circumradii: A010527 (cube), A019881 (icosahedron), A179296 (dodecahedron), A187110 (tetrahedron).
Platonic solids midradii: A020765 (tetrahedron), A020761 (octahedron), A019863 (icosahedron), A239798 (dodecahedron).
Cf. A000217, A010060, A019812, A019824, A019851, A019857, A019884, A019896.

1/Sqrt(2); // Vincenzo Librandi, Feb 21 2016

Digits:=100; evalf(1/sqrt(2)); Wesley Ivan Hurt, Mar 27 2014

N[ 1/Sqrt[2], 200]
RealDigits[1/Sqrt[2],10,120][[1]] (* Harvey P. Dale, Mar 25 2019 *)

default(realprecision, 20080); x=10*(1/sqrt(2)); for (n=0, 20000, d=floor(x); x=(x-d)*10; write("b010503.txt", n, " ", d)); \\ Harry J. Smith, Jun 02 2009

1/sqrt(2) = cos(Pi/4) = sqrt(2)/2. - Eric Desbiaux, Nov 05 2008
a(n) = 9 - A268682(n). As constants, this sequence is 1 - A268682. - Philippe Deléham, Feb 21 2016
From Amiram Eldar, Jun 29 2020: (Start)
Equals sin(Pi/4) = cos(Pi/4).
Equals Integral_{x=0..Pi/4} cos(x) dx. (End)
Equals (1/2)*A019884 + A019824 * A010527 = A019851 * A019896 + A019812 * A019857. - R. J. Mathar, Jan 27 2021
Equals hypergeom([-1/2, -3/4], [5/4], -1). - Peter Bala, Mar 02 2022
Limit_{n->oo} (sqrt(T(n+1)) - sqrt(T(n))) = 1/sqrt(2), where T(n) = n(n+1)/2 = A000217(n) is the triangular numbers. - Jules Beauchamp, Sep 18 2022
Equals Product_{k>=0} ((2*k+1)/(2*k+2))^((-1)^A000120(k)) (Woods, 1978). - Amiram Eldar, Feb 04 2024
From Stefano Spezia, Oct 15 2024: (Start)
Equals 1 + Sum_{k>=1} (-1)^k*binomial(2*k,k)/2^(2*k) [Newton].
Equal Product_{k>=1} 1 - 1/(4*(2*k - 1)^2). (End)
Equals Product_{k>=0} (1 - (-1)^k/(6*k+3)). - Amiram Eldar, Nov 22 2024

More terms from Harry J. Smith, Jun 02 2009

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)

A041085 Denominators of continued fraction convergents to sqrt(50).

Original entry on oeis.org

1, 14, 197, 2772, 39005, 548842, 7722793, 108667944, 1529074009, 21515704070, 302748930989, 4260000737916, 59942759261813, 843458630403298, 11868363584907985, 167000548819115088, 2349876047052519217, 33065265207554384126, 465263588952813896981

Offset: 0

N. J. A. Sloane

For positive n, a(n) equals the permanent of the n X n tridiagonal matrix with 14's along the main diagonal, and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
a(n) equals the number of words of length n on alphabet {0,1,...,14} avoiding runs of zeros of odd lengths. - Milan Janjic, Jan 28 2015
From Michael A. Allen, Apr 30 2023: (Start)
Also called the 14-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 14 kinds of squares available. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..800
Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (14,1).

Cf. A000129, A020807, A040042, A041084.

Row n=14 of A073133, A172236 and A352361 and column k=14 of A157103.

[n le 2 select (14)^(n-1) else 14*Self(n-1) +Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 17 2012

with(combinat): seq(fibonacci(3*n+3,2)/5, n=0..17); # Zerinvary Lajos, Apr 20 2008

LinearRecurrence[{14, 1}, {1, 14}, 30] (* Vincenzo Librandi, Nov 17 2012 *)
Table[Fibonacci[3n + 3, 2]/5, {n, 0, 20}] (* Vladimir Reshetnikov, Sep 16 2016 *)
Convergents[Sqrt[50],20]//Denominator (* Harvey P. Dale, Aug 16 2025 *)

A041085=BinaryRecurrenceSequence(14,1,1,14)
[A041085(n) for n in range(31)] # G. C. Greubel, Sep 29 2024

a(n) = round((7+5*sqrt(2))*a(n-1)). - Vladeta Jovovic, Jun 15 2003
From Paul Barry, Feb 06 2004: (Start)
a(n) = A000129(3*n+3)/5.
a(n) = (1/20)*((10+7*sqrt(2))*(1+sqrt(2))^(3*n) + (10-7*sqrt(2))*(1-sqrt(2))^(3*n)).
a(n-1) = Sum_{i=0..n} Sum_{j=0..n-i} (n!/(i!*j!*(n-i-j)!))*A000129(2*n-i)/5. (End)
a(n) = Fibonacci(n+1, 14), the n-th Fibonacci polynomial evaluated at x=14. - T. D. Noe, Jan 19 2006
From Philippe Deléham, Nov 03 2008: (Start)
a(n) = 14*a(n-1) + a(n-2); a(0)=1, a(1)=14.
G.f.: 1/(1-14*x-x^2). (End)
a(n) = ((7+5*sqrt(2))^(n+1) - (7-5*sqrt(2))^(n+1))/(10*sqrt(2)). - Gerry Martens, Jul 11 2015

Additional term from Colin Barker, Nov 12 2013

A040182 Continued fraction for sqrt(197).

Original entry on oeis.org

14, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28

Offset: 0

N. J. A. Sloane

			14 + 1/(28 + 1/(28 + 1/(28 + 1/(28 + ...)))) = sqrt(197).

Cf. A041364/A041365 (convergents).

Cf. A040000, A040002, A040042.

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

ContinuedFraction[Sqrt[197],300] (* Vladimir Joseph Stephan Orlovsky, Mar 28 2011 *)
PadRight[{14},120,{28}] (* Harvey P. Dale, May 02 2022 *)

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

A040420 Continued fraction for sqrt(442).

Original entry on oeis.org

21, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42

Offset: 0

N. J. A. Sloane

			21 + 1/(42 + 1/(42 + 1/(42 + 1/(42 + ...)))) = sqrt(442).

Cf. A041840/A041841 (convergents).

Cf. A040000, A040006, A040042.

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

Block[{$MaxExtraPrecision=1000}, ContinuedFraction[Sqrt[442],120]] (* or *) PadRight[{21},120,{42}] (* Harvey P. Dale, Nov 28 2024 *)

From Elmo R. Oliveira, Feb 15 2024: (Start)
a(n) = 42 for n >= 1.
G.f.: 21*(1+x)/(1-x).
E.g.f.: 42*exp(x) - 21.
a(n) = 21*A040000(n) = 7*A040006(n) = 3*A040042(n). (End)

A040930 Continued fraction for sqrt(962).

Original entry on oeis.org

31, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62

Offset: 0

N. J. A. Sloane

			31 + 1/(62 + 1/(62 + 1/(62 + 1/(62 + ...)))) = sqrt(962).

Cf. A042860/A042861 (convergents).

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 (contfrac(sqrt(901)) = (30,60,60,...)).

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

PadRight[{31},100,62] (* Harvey P. Dale, Sep 18 2012 *)

G.f.: 31*(1+x)/(1-x). - Colin Barker, Aug 11 2012
From Elmo R. Oliveira, Feb 16 2024: (Start)
a(n) = 62 for n >= 1.
E.g.f.: 62*exp(x) - 31.
a(n) = 31*A040000(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

A010503 Decimal expansion of 1/sqrt(2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A040002 Continued fraction for sqrt(5).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A041085 Denominators of continued fraction convergents to sqrt(50).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

SageMath

Formula

Extensions

A040182 Continued fraction for sqrt(197).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A040420 Continued fraction for sqrt(442).

Views

Author

Keywords

Examples

Links

Crossrefs