A002163 -id:A002163 - cp's OEIS frontend

A001622 Decimal expansion of golden ratio phi (or tau) = (1 + sqrt(5))/2.

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

Offset: 1

N. J. A. Sloane

Also decimal expansion of the positive root of (x+1)^n - x^(2n). (x+1)^n - x^(2n) = 0 has only two real roots x1 = -(sqrt(5)-1)/2 and x2 = (sqrt(5)+1)/2 for all n > 0. - Cino Hilliard, May 27 2004
The golden ratio phi is the most irrational among irrational numbers; its successive continued fraction convergents F(n+1)/F(n) are the slowest to approximate to its actual value (I. Stewart, in "Nature's Numbers", Basic Books, 1997). - Lekraj Beedassy, Jan 21 2005
Let t=golden ratio. The lesser sqrt(5)-contraction rectangle has shape t-1, and the greater sqrt(5)-contraction rectangle has shape t. For definitions of shape and contraction rectangles, see A188739. - Clark Kimberling, Apr 16 2011
The golden ratio (often denoted by phi or tau) is the shape (i.e., length/width) of the golden rectangle, which has the special property that removal of a square from one end leaves a rectangle of the same shape as the original rectangle. Analogously, removals of certain isosceles triangles characterize side-golden and angle-golden triangles. Repeated removals in these configurations result in infinite partitions of golden rectangles and triangles into squares or isosceles triangles so as to match the continued fraction, [1,1,1,1,1,...] of tau. For the special shape of rectangle which partitions into golden rectangles so as to match the continued fraction [tau, tau, tau, ...], see A188635. For other rectangular shapes which depend on tau, see A189970, A190177, A190179, A180182. For triangular shapes which depend on tau, see A152149 and A188594; for tetrahedral, see A178988. - Clark Kimberling, May 06 2011
Given a pentagon ABCDE, 1/(phi)^2 <= (A*C^2 + C*E^2 + E*B^2 + B*D^2 + D*A^2) / (A*B^2 + B*C^2 + C*D^2 + D*E^2 + E*A^2) <= (phi)^2. - Seiichi Kirikami, Aug 18 2011
If a triangle has sides whose lengths form a geometric progression in the ratio of 1:r:r^2 then the triangle inequality condition requires that r be in the range 1/phi < r < phi. - Frank M Jackson, Oct 12 2011
The graphs of x-y=1 and x*y=1 meet at (tau,1/tau). - Clark Kimberling, Oct 19 2011
Also decimal expansion of the first root of x^sqrt(x+1) = sqrt(x+1)^x. - Michel Lagneau, Dec 02 2011
Also decimal expansion of the root of (1/x)^(1/sqrt(x+1)) = (1/sqrt(x+1))^(1/x). - Michel Lagneau, Apr 17 2012
This is the case n=5 of (Gamma(1/n)/Gamma(3/n))*(Gamma((n-1)/n)/Gamma((n-3)/n)): (1+sqrt(5))/2 = (Gamma(1/5)/Gamma(3/5))*(Gamma(4/5)/Gamma(2/5)). - Bruno Berselli, Dec 14 2012
Also decimal expansion of the only number x>1 such that (x^x)^(x^x) = (x^(x^x))^x = x^((x^x)^x). - Jaroslav Krizek, Feb 01 2014
For n >= 1, round(phi^prime(n)) == 1 (mod prime(n)) and, for n >= 3, round(phi^prime(n)) == 1 (mod 2*prime(n)). - Vladimir Shevelev, Mar 21 2014
The continuous radical sqrt(1+sqrt(1+sqrt(1+...))) tends to phi. - Giovanni Zedda, Jun 22 2019
Equals sqrt(2+sqrt(2-sqrt(2+sqrt(2-...)))). - Diego Rattaggi, Apr 17 2021
Given any complex p such that real(p) > -1, phi is the only real solution of the equation z^p+z^(p+1)=z^(p+2), and the only attractor of the complex mapping z->M(z,p), where M(z,p)=(z^p+z^(p+1))^(1/(p+2)), convergent from any complex plane point. - Stanislav Sykora, Oct 14 2021
The only positive number such that its decimal part, its integral part and the number itself (x-[x], [x] and x) form a geometric progression is phi, with respectively (phi -1, 1, phi) and a ratio = phi. This is the answer to the 4th problem of the 7th Canadian Mathematical Olympiad in 1975 (see IMO link and Doob reference). - Bernard Schott, Dec 08 2021
The golden ratio is the unique number x such that f(n*x)*c(n/x) - f(n/x)*c(n*x) = n for all n >= 1, where f = floor and c = ceiling. - Clark Kimberling, Jan 04 2022
In The Second Scientific American Book Of Mathematical Puzzles and Diversions, Martin Gardner wrote that, by 1910, Mark Barr (1871-1950) gave phi as a symbol for the golden ratio. - Bernard Schott, May 01 2022
Phi is the length of the equal legs of an isosceles triangle with side c = phi^2, and internal angles (A,B) = 36 degrees, C = 108 degrees. - Gary W. Adamson, Jun 20 2022
The positive solution to x^2 - x - 1 = 0. - Michal Paulovic, Jan 16 2023
The minimal polynomial of phi^n, for nonvanishing integer n, is P(n, x) = x^2 - L(n)*x + (-1)^n, with the Lucas numbers L = A000032, extended to negative arguments with L(n) = (-1)^n*L(n). P(0, x) = (x - 1)^2 is not minimal. - Wolfdieter Lang, Feb 20 2025
This is the largest real zero x of (x^4 + x^2 + 1)^2 = 2*(x^8 + x^4 + 1). - Thomas Ordowski, May 14 2025

			1.6180339887498948482045868343656381177203091798057628621...

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 24, 112, 123, 184, 190, 203.
Michael Doob, The Canadian Mathematical Olympiad & L'Olympiade Mathématique du Canada 1969-1993 - Canadian Mathematical Society & Société Mathématique du Canada, Problem 4, 1975, pages 76-77, 1993.
Richard A. Dunlap, The Golden Ratio and Fibonacci Numbers, World Scientific, River Edge, NJ, 1997.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, Vol. 94, Cambridge University Press, 2003, Section 1.2.
Martin Gardner, The Second Scientific American Book Of Mathematical Puzzles and Diversions, "Phi: The Golden Ratio", Chapter 8, Simon & Schuster, NY, 1961.
Martin Gardner, Weird Water and Fuzzy Logic: More Notes of a Fringe Watcher, "The Cult of the Golden Ratio", Chapter 9, Prometheus Books, 1996, pages 90-97.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.5 The Fibonacci and Related Sequences, p. 287.
H. E. Huntley, The Divine Proportion, Dover, NY, 1970.
Mario Livio, The Golden Ratio, Broadway Books, NY, 2002. [see the review by G. Markowsky in the links field]
Gary B. Meisner, The Golden Ratio: The Divine Beauty of Mathematics, Race Point Publishing (The Quarto Group), 2018. German translation: Der Goldene Schnitt, Librero, 2023.
Scott Olsen, The Golden Section, Walker & Co., NY, 2006.
Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 137-139.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Hans Walser, The Golden Section, Math. Assoc. of Amer. Washington DC 2001.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See pp. 36-40.
Claude-Jacques Willard, Le nombre d'or, Magnard, Paris, 1987.

Robert G. Wilson v, Table of n, a(n) for n = 1..100000
Mohammad K. Azarian, Problem 123, Missouri Journal of Mathematical Sciences, Vol. 10, No. 3 (Fall 1998), p. 176; Solution, ibid., Vol. 12, No. 1 (Winter 2000), pp. 61-62.
John Baez, This week's finds in mathematical physics, Week 203.
John Baez, The Rankin Lectures 2008, My Favorite Numbers: 5. [video]
Murray Berg, Phi, the golden ratio (to 4599 decimal places) and Fibonacci numbers, Fib. Quart., Vol. 4, No. 2 (1961), pp. 157-162.
Ömür Deveci, Zafer Adıgüzel and Taha Doğan, On the Generalized Fibonacci-circulant-Hurwitz numbers, Notes on Number Theory and Discrete Mathematics (2020) Vol. 26, No. 1, 179-190.
T. Eveilleau, Le nombre d'or (in French).
Abdul Gaffar, Anand B. Joshi, Sonali Singh, and Keerti Srivastava, A high capacity multi-image steganography technique based on golden ratio and non-subsampled contourlet transform, Multimedia Tools and Applications (2022).
Gutenberg Project, The golden ratio to 20000 places.
ICON Project, The golden ratio to 50000 places.
The IMO Compendium, Problem 4, 7th Canadian Mathematical Olympiad 1975.
L. B. W. Jolley, Summation of Series, Dover, 1961
Franklin H. J. Kenter, It's good to be phi: a solution to a problem of Gosper and Knuth, arXiv:1712.04856 [math.HO], 2017.
Clark Kimberling, Two kinds of golden triangles, generalized to match continued fractions, Journal for Geometry and Graphics, Vol. 11 (2007), pp. 165-171.
Clark Kimberling, Lucas Representations of Positive Integers, J. Int. Seq., Vol. 23 (2020), Article 20.9.5.
Ron Knott, Fibonacci numbers and the golden section.
Wolfdieter Lang, A list of representative simple difference sets of the Singer type for small orders m, Karlsruher Institut für Technologie (Karlsruhe, Germany 2020).
Wolfdieter Lang, Cantor's List of Real Algebraic Numbers of Heights 1 to 7, arXiv:2307.10645 [math.NT], 2023.
Simon Litsyn and Vladimir Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, Vol. 1, No. 4 (2005), pp. 499-512.
Gary B. Meisner, Phi, The Golden Number.
George Markowsky, Misconceptions About the Golden Ratio, College Mathematics Journal, 23:1 (January 1992), 2-19.
George Markowsky, Book review: The Golden Ratio, Notices of the AMS, 52:3 (March 2005), 344-347.
R. S. Melham and A. G. Shannon, Inverse Trigonometric Hyperbolic Summation Formulas Involving Generalized Fibonacci Numbers, The Fibonacci Quarterly, Vol. 33, No. 1 (1995), pp. 32-40.
Jean-Christophe Michel, Le nombre d'or.
J. J. O'Connor and E. F. Robertson, The Golden ratio.
Hugo Pfoertner, 1 million digits of phi, Computed using A. J. Yee's y-cruncher.
Simon Plouffe, Plouffe's Inverter, The golden ratio to 10 million digits. [Only announcement, file truncated]
Simon Plouffe, The golden ratio:(1+sqrt(5))/2 to 20000 places.
Fred Richman, Fibonacci sequence with multiprecision Java, Successive approximations to phi from ratios of consecutive Fibonacci numbers.
Herman P. Robinson, The CSR Function, Popular Computing (Calabasas, CA), Vol. 4, No. 35 (Feb 1976), pages PC35-3 to PC35-4. Annotated and scanned copy.
E. F. Schubert, The Fibonacci series.
Vladimir Shevelev, A property of n-bonacci constant, Seqfan (Mar 23 2014).
Jonathan Sondow, Evaluation of Tachiya's algebraic infinite products involving Fibonacci and Lucas numbers, Diophantine Analysis and Related Fields 2011 - AIP Conference Proceedings, Vol. 1385, pp. 97-100; arXiv:1106.4246 [math.NT], 2011.
Matthew R. Watkins, The "Golden Mean" in number theory.
Eric Weisstein's World of Mathematics, Golden Ratio.
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.
Eric Weisstein's World of Mathematics, Pisot Number.
Eric Weisstein's World of Mathematics, Silver Ratio.
Wikipedia, Mark Barr.
Wikipedia, Golden ratio.
Wikipedia, Kronecker-Weber theorem.
Wikipedia, Metallic mean.
Alexander J. Yee, y-cruncher - A Multi-Threaded Pi-Program.
Index entries for algebraic numbers, degree 2.
Index to sequences related to Olympiads.

Cf. A000012 (continued fraction coefficients), A000032, A000045, A006497, A080039, A104457, A188635, A192222, A192223, A145996, A139339, A197762, A002163, A094874, A134973.
Cf. A102208, A102769, A131595.
Cf. A302973, A303069, A304022.

Digits:=1000; evalf((1+sqrt(5))/2); # Wesley Ivan Hurt, Nov 01 2013

RealDigits[(1 + Sqrt[5])/2, 10, 130] (* Stefan Steinerberger, Apr 02 2006 *)
RealDigits[ Exp[ ArcSinh[1/2]], 10, 111][[1]] (* Robert G. Wilson v, Mar 01 2008 *)
RealDigits[GoldenRatio,10,120][[1]] (* Harvey P. Dale, Oct 28 2015 *)

default(realprecision, 20080); x=(1+sqrt(5))/2; for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b001622.txt", n, " ", d));  \\ Harry J. Smith, Apr 19 2009

/* Digit-by-digit method: write it as 0.5+sqrt(1.25) and start at hundredths digit */
r=11; x=400; print(1); print(6);
for(dig=1, 110, {d=0; while((20*r+d)*d <= x, d++);
d--; /* while loop overshoots correct digit */
print(d); x=100*(x-(20*r+d)*d); r=10*r+d})
\\ Michael B. Porter, Oct 24 2009

a(n) = floor(10^(n-1)*(quadgen(5))%10);
alist(len) = digits(floor(quadgen(5)*10^(len-1))); \\ Chittaranjan Pardeshi, Jun 22 2022

from sympy import S
def alst(n): # truncate extra last digit to avoid rounding
  return list(map(int, str(S.GoldenRatio.n(n+1)).replace(".", "")))[:-1]
print(alst(105)) # Michael S. Branicky, Jan 06 2021

Equals Sum_{n>=2} 1/A064170(n) = 1/1 + 1/2 + 1/(2*5) + 1/(5*13) + 1/(13*34) + ... - Gary W. Adamson, Dec 15 2007
Equals Hypergeometric2F1([1/5, 4/5], [1/2], 3/4) = 2*cos((3/5)*arcsin(sqrt(3/4))). - Artur Jasinski, Oct 26 2008
From Hieronymus Fischer, Jan 02 2009: (Start)
The fractional part of phi^n equals phi^(-n), if n is odd. For even n, the fractional part of phi^n is equal to 1-phi^(-n).
General formula: Provided x>1 satisfies x-x^(-1)=floor(x), where x=phi for this sequence, then:
for odd n: x^n - x^(-n) = floor(x^n), hence fract(x^n) = x^(-n),
for even n: x^n + x^(-n) = ceiling(x^n), hence fract(x^n) = 1 - x^(-n),
for all n>0: x^n + (-x)^(-n) = round(x^n).
x=phi is the minimal solution to x - x^(-1) = floor(x) (where floor(x)=1 in this case).
Other examples of constants x satisfying the relation x - x^(-1) = floor(x) include A014176 (the silver ratio: where floor(x)=2) and A098316 (the "bronze" ratio: where floor(x)=3). (End)
Equals 2*cos(Pi/5) = e^(i*Pi/5) + e^(-i*Pi/5). - Eric Desbiaux, Mar 19 2010
The solutions to x-x^(-1)=floor(x) are determined by x=(1/2)*(m+sqrt(m^2+4)), m>=1; x=phi for m=1. In terms of continued fractions the solutions can be described by x=[m;m,m,m,...], where m=1 for x=phi, and m=2 for the silver ratio A014176, and m=3 for the bronze ratio A098316. - Hieronymus Fischer, Oct 20 2010
Sum_{n>=1} x^n/n^2 = Pi^2/10 - (log(2)*sin(Pi/10))^2 where x = 2*sin(Pi/10) = this constant here. [Jolley, eq 360d]
phi = 1 + Sum_{k>=1} (-1)^(k-1)/(F(k)*F(k+1)), where F(n) is the n-th Fibonacci number (A000045). Proof. By Catalan's identity, F^2(n) - F(n-1)*F(n+1) = (-1)^(n-1). Therefore,(-1)^(n-1)/(F(n)*F(n+1)) = F(n)/F(n+1) - F(n-1)/F(n). Thus Sum_{k=1..n} (-1)^(k-1)/(F(k)*F(k+1)) = F(n)/F(n+1). If n goes to infinity, this tends to 1/phi = phi - 1. - Vladimir Shevelev, Feb 22 2013
phi^n = (A000032(n) + A000045(n)*sqrt(5)) / 2. - Thomas Ordowski, Jun 09 2013
Let P(q) = Product_{k>=1} (1 + q^(2*k-1)) (the g.f. of A000700), then A001622 = exp(Pi/6) * P(exp(-5*Pi)) / P(exp(-Pi)). - Stephen Beathard, Oct 06 2013
phi = i^(2/5) + i^(-2/5) = ((i^(4/5))+1) / (i^(2/5)) = 2*(i^(2/5) - (sin(Pi/5))i) = 2*(i^(-2/5) + (sin(Pi/5))i). - Jaroslav Krizek, Feb 03 2014
phi = sqrt(2/(3 - sqrt(5))) = sqrt(2)/A094883. This follows from the fact that ((1 + sqrt(5))^2)*(3 - sqrt(5)) = 8, so that ((1 + sqrt(5))/2)^2 = 2/(3 - sqrt(5)). - Geoffrey Caveney, Apr 19 2014
exp(arcsinh(cos(Pi/2-log(phi)*i))) = exp(arcsinh(sin(log(phi)*i))) = (sqrt(3) + i) / 2. - Geoffrey Caveney, Apr 23 2014
exp(arcsinh(cos(Pi/3))) = phi. - Geoffrey Caveney, Apr 23 2014
cos(Pi/3) + sqrt(1 + cos(Pi/3)^2). - Geoffrey Caveney, Apr 23 2014
2*phi = z^0 + z^1 - z^2 - z^3 + z^4, where z = exp(2*Pi*i/5). See the Wikipedia Kronecker-Weber theorem link. - Jonathan Sondow, Apr 24 2014
phi = 1/2 + sqrt(1 + (1/2)^2). - Geoffrey Caveney, Apr 25 2014
Phi is the limiting value of the iteration of x -> sqrt(1+x) on initial value a >= -1. - Chayim Lowen, Aug 30 2015
From Isaac Saffold, Feb 28 2018: (Start)
1 = Sum_{k=0..n} binomial(n, k) / phi^(n+k) for all nonnegative integers n.
1 = Sum_{n>=1} 1 / phi^(2n-1).
1 = Sum_{n>=2} 1 / phi^n.
phi = Sum_{n>=1} 1/phi^n. (End)
From Christian Katzmann, Mar 19 2018: (Start)
phi = Sum_{n>=0} (15*(2*n)! + 8*n!^2)/(2*n!^2*3^(2*n+2)).
phi = 1/2 + Sum_{n>=0} 5*(2*n)!/(2*n!^2*3^(2*n+1)). (End)
phi = Product_{k>=1} (1 + 2/(-1 + 2^k*(sqrt(4+(1-2/2^k)^2) + sqrt(4+(1-1/2^k)^2)))). - Gleb Koloskov, Jul 14 2021
Equals Product_{k>=1} (Fibonacci(3*k)^2 + (-1)^(k+1))/(Fibonacci(3*k)^2 + (-1)^k) (Melham and Shannon, 1995). - Amiram Eldar, Jan 15 2022
From Michal Paulovic, Jan 16 2023: (Start)
Equals the real part of 2 * e^(i * Pi / 5).
Equals 2 * sin(3 * Pi / 10) = 2*A019863.
Equals -2 * sin(37 * Pi / 10).
Equals 1 + 1 / (1 + 1 / (1 + 1 / (1 + 1 / (1 + 1 / ...)))).
Equals (2 + 3 * (2 + 3 * (2 + 3 * ...)^(1/4))^(1/4))^(1/4).
Equals (1 + 2 * (1 + 2 * (1 + 2 * ...)^(1/3))^(1/3))^(1/3).
Equals (1 + phi + (1 + phi + (1 + phi + ...)^(1/3))^(1/3))^(1/3).
Equals 13/8 + Sum_{k=0..oo} (-1)^(k+1)*(2*k+1)!/((k+2)!*k!*4^(2*k+3)).
(End)
phi^n = phi * A000045(n) + A000045(n-1). - Gary W. Adamson, Sep 09 2023
The previous formula holds for integer n, with F(-n) = (-1)^(n+1)*F(n), for n >= 0, with F(n) = A000045(n), for n >= 0. phi^n are integers in the quadratic number field Q(sqrt(5)). - Wolfdieter Lang, Sep 16 2023
Equals Product_{k>=0} ((5*k + 2)*(5*k + 3))/((5*k + 1)*(5*k + 4)). - Antonio Graciá Llorente, Feb 24 2024
From Antonio Graciá Llorente, Apr 21 2024: (Start)
Equals Product_{k>=1} phi^(-2^k) + 1, with phi = A001622.
Equals Product_{k>=0} ((5^(k+1) + 1)*(5^(k-1/2) + 1))/((5^k + 1)*(5^(k+1/2) + 1)).
Equals Product_{k>=1} 1 - (4*(-1)^k)/(10*k - 5 + (-1)^k) = Product_{k>=1} A047221(k)/A047209(k).
Equals Product_{k>=0} ((5*k + 7)*(5*k + 1 + (-1)^k))/((5*k + 1)*(5*k + 7 + (-1)^k)).
Equals Product_{k>=0} ((10*k + 3)*(10*k + 5)*(10*k + 8)^2)/((10*k + 2)*(10*k + 4)*(10*k + 9)^2).
Equals Product_{k>=5} 1 + 1/(Fibonacci(k) - (-1)^k).
Equals Product_{k>=2} 1 + 1/Fibonacci(2*k).
Equals Product_{k>=2} (Lucas(k)^2 + (-1)^k)/(Lucas(k)^2 - 4*(-1)^k). (End)

Additional links contributed by Lekraj Beedassy, Dec 23 2003
More terms from Gabriel Cunningham (gcasey(AT)mit.edu), Oct 24 2004
More terms from Stefan Steinerberger, Apr 02 2006
Broken URL to Project Gutenberg replaced by Georg Fischer, Jan 03 2009
Edited by M. F. Hasler, Feb 24 2014

A195284 Decimal expansion of shortest length of segment from side AB through incenter to side AC in right triangle ABC with sidelengths (a,b,c)=(3,4,5); i.e., decimal expansion of 2*sqrt(10)/3.

Original entry on oeis.org

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

Offset: 1

Clark Kimberling, Sep 14 2011

Apart from the first digit, the same as A176219 (decimal expansion of 2+2*sqrt(10)/3).
The Philo line of a point P inside an angle T is the shortest segment that crosses T and passes through P. Philo lines are not generally Euclidean-constructible.
...
Suppose that P lies inside a triangle ABC. Let (A) denote the shortest length of segment from AB through P to AC, and likewise for (B) and (C). The Philo number for ABC and P is here introduced as the normalized sum ((A)+(B)+(C))/(a+b+c), denoted by Philo(ABC,P).
...
Listed below are examples for which P=incenter (the center, I, of the circle inscribed in ABC, the intersection of the angle bisectors of ABC); in this list, r'x means sqrt(x), and t=(1+sqrt(5))/2 (the golden ratio).
a....b....c.......(A).......(B).......(C)....Philo(ABC,I)
3....4....5.....A195284...A002163...A010466...A195285
5....12...13....A195286...A195288...A010487...A195289
7....24...25....A195290...A010524...15/2......A195292
8....15...17....A195293...A195296...A010524...A195297
28...45...53....A195298...A195299...A010466...A195300
1....1....r'2...A195301...A195301...A163960...A195303
1....2....r'5...A195340...A195341...A195342...A195343
1....3....r'10..A195344...A195345...A195346...A195347
2....3....r'13..A195355...A195356...A195357...A195358
2....5....r'29..A195359...A195360...A195361...A195362
r'2..r'3..r'5...A195365...A195366...A195367...A195368
1....r'2..r'3...A195369...A195370...A195371...A195372
1....r'3..2.....A195348...A093821...A120683...A195380
2....r'5..3.....A195381...A195383...A195384...A195385
r'2..r'5..r'7...A195386...A195387...A195388...A195389
r'3..r'5..r'8...A195395...A195396...A195397...A195398
r'7..3....4.....A195399...A195400...A195401...A195402
1....r't..t.....A195403...A195404...A195405...A195406
t-1..t....r'3...A195407...A195408...A195409...A195410
...
In the special case that P is the incenter, I, each Philo line, being perpendicular to an angle bisector, is constructible, and (A),(B),(C) can be evaluated exactly.
For the 3,4,5 right triangle, (A)=(2/3)*sqrt(10), (B)=sqrt(5), (C)=sqrt(8), so that Philo(ABC,I)=((2/3)sqrt(10)+sqrt(5)+sqrt(8))/12, approximately 0.59772335.
...
More generally, for arbitrary right triangle (a,b,c) with a<=b(A)=f*sqrt(a^2+(b+c)^2)/(b+c),
(B)=f*sqrt(b^2+(c+a)^2)/(c+a),
(C)=f*sqrt(2).
It appears that I is the only triangle center P for which simple formulas for (A), (B), (C) are available. For P=centroid, see A195304.

			2.10818510677891955466592902962...

David Gale, Tracking the Automatic Ant and Other Mathematical Explorations, A Collection of Mathematical Entertainments Columns from The Mathematical Intelligencer, Springer, 1998; see chapter 16.
Clark Kimberling, Geometry In Action, Key College Publishing, 2003, pages 115-116.

Michael Cavers, Spiked Math #524 (2012)
Clark Kimberling, Geometry In Action, 2003, scanned copy (with permission). See pages 115-116.
Index entries for algebraic numbers, degree 2.

Cf. A002163, A010466, A195285, A195304.

philo := proc(a,b,c) local f, A, B, C, P:
f:=2*a*b/(a+b+c):
A:=f*sqrt((a^2+(b+c)^2))/(b+c):
B:=f*sqrt((b^2+(c+a)^2))/(c+a):
C:=f*sqrt(2):
P:=(A+B+C)/(a+b+c):
print(simplify([A,B,C,P])):
print(evalf([A,B,C,P])): end:
philo(3,4,5); # Georg Fischer, Jul 18 2021

a = 3; b = 4; c = 5;
h = a (a + c)/(a + b + c); k = a*b/(a + b + c); (* incenter *)
f[t_] := (t - a)^2 + ((t - a)^2) ((a*k - b*t)/(a*h - a*t))^2;
s = NSolve[D[f[t], t] == 0, t, 150]
f1 = (f[t])^(1/2) /. Part[s, 4]
RealDigits[%, 10, 100] (* (A) 195284 *)
f[t_] := (b*t/a)^2 + ((b*t/a)^2) ((a*h - a*t)/(b*t - a*k))^2
s = NSolve[D[f[t], t] == 0, t, 150]
f2 = (f[t])^(1/2) /. Part[s, 1]
RealDigits[%, 10, 100] (* (B) A002163 *)
f[t_] := (t - a)^2 + ((t - a)^2) (k/(h - t))^2
s = NSolve[D[f[t], t] == 0, t, 150]
f3 = (f[t])^(1/2) /. Part[s, 4]
RealDigits[%, 10, 100] (* (C) A010466 *)
(f1 + f2 + f3)/(a + b + c)
RealDigits[%, 10, 100] (* Philo(ABC,I) A195285 *)

(2/3)*sqrt(10) \\ Michel Marcus, Dec 24 2017

Equals (2/3)*sqrt(10).

Table and formulas corrected by Georg Fischer, Jul 17 2021

A098317 Decimal expansion of phi^3 = 2 + sqrt(5).

Original entry on oeis.org

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

Offset: 1

Eric W. Weisstein, Sep 02 2004

This sequence is also the decimal expansion of ((1+sqrt(5))/2)^3. - Mohammad K. Azarian, Apr 14 2008
This is the length/width ratio of a 4-extension rectangle; see A188640 for definitions. - Clark Kimberling, Apr 10 2011
Its continued fraction is [4, 4, ...] (see A010709). - Robert G. Wilson v, Apr 10 2011

			4.23606797749978969640917366873127623544061835961152572427...

Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 138-139.
Alexey Stakhov, The mathematics of harmony: from Euclid to contemporary mathematics and computer science, World Scientific, Singapore, 2009, p. 657.

G. C. Greubel, Table of n, a(n) for n = 1..10000
Wikipedia, Metallic mean
Index entries for algebraic numbers, degree 2

Cf. A001622, A014176, A098316, A098318.

Cf. A001076, A049310.

SetDefaultRealField(RealField(100)); 2+Sqrt(5); // G. C. Greubel, Jun 30 2019

RealDigits[N[2+Sqrt[5],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 21 2011 *)

sqrt(5)+2 \\ Charles R Greathouse IV, Mar 11 2012

numerical_approx(2+sqrt(5), digits=100) # G. C. Greubel, Jun 30 2019

2 plus the constant in A002163. - R. J. Mathar, Sep 02 2008
Equals 3 + 4*sin(Pi/10) = 1 + 4*cos(Pi/5) = 1 + 4*sin(3*Pi/10) = 3 + 4*cos(2*Pi/5) = 1 + csc(Pi/10). - Arkadiusz Wesolowski, Mar 11 2012
Equals lim_{n -> infinity} F(n+3)/F(n) = lim_{n -> infinity} (1 + 2*F(n+1)/F(n)) = 2 + sqrt(5), with F(n) = A000045(n). - Arkadiusz Wesolowski, Mar 11 2012
Equals exp(arcsinh(2)), since arcsinh(x) = log(x+sqrt(x^2+1)). - Stanislav Sykora, Nov 01 2013
Equals Sum_{n>=1} n/phi^n = phi/(phi-1)^2 = phi^3. - Richard R. Forberg, Jun 29 2014
Equals 1 + 2*phi, with phi = A001622, an integer in the quadratic number field Q(sqrt(5)). - Wolfdieter Lang, Dec 10 2022
c^n = A001076(n-1) + c * A001076(n); where c = 2 + sqrt(5). - Gary W. Adamson, Oct 09 2023
Equals lim_{n -> infinity} = S(n, 2*(-1 + 2*phi))/S(n-1, 2*(-1 + 2*phi)), with the S-Chebyshev polynomials (see A049310). See also the above limit formula with Fibonacci numbers. - Wolfdieter Lang, Nov 15 2023

Title expanded to include observation from Mohammad K. Azarian by Charles R Greathouse IV, Mar 11 2012

A079586 Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).

Original entry on oeis.org

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

Offset: 1

Benoit Cloitre, Jan 26 2003

André-Jeannin proved that this constant is irrational.

This constant does not belong to the quadratic number field Q(sqrt(5)) (Bundschuh and Väänänen, 1994). - Amiram Eldar, Oct 30 2020

			3.35988566624317755317201130291892717968890513373...

Daniel Duverney, Number Theory, World Scientific, 2010, 5.22, pp.75-76.
Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, p. 358.

Kenny Lau, Table of n, a(n) for n = 1..10000 (First 1000 terms computed by Joerg Arndt)
Richard André-Jeannin, Irrationalité de la somme des inverses de certaines suites récurrentes, Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 308:19 (1989), pp. 539-541.
Richard André-Jeannin, Problem H-450, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 29, No. 1 (1991), p. 89; Comparable, Solution to Problem H-450 by Paul S. Bruckman, ibid., Vol. 30, No. 2 (1992), p. 191-192.
Richard André-Jeannin, Sequences of Integers Satisfying Recurrence Relations, The Fibonacci Quarterly, Vol. 29, No. 3 (1991), pp. 205-208;
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).
Paul S. Bruckman, Problem B-602, Elementary Problems and Solutions, The Fibonacci Quarterly, Vol. 25, No. 3 (1987), p. 279; Fibonacci Infinite Series, Solution to Problem B-602 by C. Georghiou, ibid., Vol. 26, No. 3 (1988), pp. 281-282.
Peter Bundschuh and Keijo Väänänen, Arithmetical investigations of a certain infinite product, Compositio Mathematica, Vol. 91, No. 2 (1994), pp. 175-199.
Daniel Duverney, Irrationalité de la somme des inverses de la suite Fibonacci, Elemente der Mathematik, Vol. 52, No. 1 (1997), pp. 31-36.
William Gosper, Acceleration of Series, Artificial Intelligence Memo #304 (1974).
W. E. Greig, Sums of Fibonacci reciprocals, The Fibonacci Quarterly, Vol. 15, No. 1 (1977), pp. 46-48.
Peter Griffin, Acceleration of the Sum of Fibonacci Reciprocals, The Fibonacci Quarterly, Vol. 30, No. 2 (1992), pp. 179-181.
Sarah H. Holliday and Takao Komatsu, On the sum of reciprocal generalized Fibonacci numbers, Integers 11A (2011), Article 11. Alternate link.
A. F. Horadam, Elliptic functions and Lambert series in the summation of reciprocals in certain recurrence-generated sequences, The Fibonacci Quarterly, Vol. 26, No.2 (May-1988), pp. 98-114.
Fredrik Johansson, The reciprocal Fibonacci constant.
Paul Kinlaw, Michael Morris, and Samanthak Thiagarajan, Sums related to the Fibonacci sequence, Husson University (2021).
Tapani Matala-Aho and Marc Prévost, Quantitative irrationality for sums of reciprocals of Fibonacci and Lucas numbers, Ramanujan J., Vol. 11 (2006), pp. 249-261.
Z.W. M. Trzaska, Fibonacci Polynomials their Properties and Applications, Z. Anal. Anwend. 15 (1996), no. 3, pp. 729-746.
Eric Weisstein's World of Mathematics, Reciprocal Fibonacci Constant.
Wikipedia, Reciprocal Fibonacci constant.

Cf. A000045, A000796, A001622, A002163, A002390, A084119, A093540, A016628, A105199, A153386, A153387.

Cf. A350901, A350902, A350903, A350904.

Digits := 120: c := Pi/2 + I*arccsch(2):
Jeannin := n -> sqrt(5/4)*add(I^(1-j)/sin(j*c), j = 1..n):
evalf(Jeannin(1000)); # Peter Luschny, Nov 15 2023

digits = 105; Sqrt[5]*NSum[(-1)^n/(GoldenRatio^(2*n + 1) - (-1)^n), {n, 0, Infinity}, WorkingPrecision -> digits, NSumTerms -> digits] // RealDigits[#, 10, digits] & // First (* Jean-François Alcover, Apr 09 2013 *)
First@RealDigits[Sqrt[5]/4 ((Log[5] + 2 QPolyGamma[1, 1/GoldenRatio^4] - 4 QPolyGamma[1, 1/GoldenRatio^2])/(2 Log[GoldenRatio]) + EllipticTheta[2, 0, 1/GoldenRatio^2]^2), 10, 105] (* Vladimir Reshetnikov, Nov 18 2015 *)

/* Fast computation without splitting into even and odd indices, see the Arndt reference */
lambert2(x, a, S)=
{
/* Return G(x,a) = Sum_{n>=1} a*x^n/(1-a*x^n) (generalized Lambert series)
   computed as Sum_{n=1..S} x^(n^2)*a^n*( 1/(1-x^n) + a*x^n/(1-a*x^n) )
   As series in x correct up to order S^2.
   We also have G(x,a) = Sum_{n>=1} a^n*x^n/(1-x^n) */
    return( sum(n=1,S, x^(n^2)*a^n*( 1/(1-x^n) + a*x^n/(1-a*x^n) ) ) );
}
inv_fib_sum(p=1, q=1, S)=
{
/* Return Sum_{n>=1} 1/f(n) where f(0)=0, f(1)=1, f(n) = p*f(n-1) + q*f(n-1)
   computed using generalized Lambert series.
   Must have p^2+4*q > 0 */
    my(al,be);
    \\ Note: the q here is -q in the Horadam paper.
    \\ The following numerical examples are for p=q=1:
    al=1/2*(p+sqrt(p^2+4*q));  \\ == +1.6180339887498...
    be=1/2*(p-sqrt(p^2+4*q));  \\ == -0.6180339887498...
    return( (al-be)*( 1/(al-1) + lambert2(be/al, 1/al, S) ) ); \\ == 3.3598856...
}
default(realprecision,100);
S = 1000; /* (be/al)^S == -0.381966^S == -1.05856*10^418 << 10^-100 */
inv_fib_sum(1,1,S) /* 3.3598856... */ /* Joerg Arndt, Jan 30 2011 */

suminf(k=1, 1/(fibonacci(k))) \\ Michel Marcus, Feb 19 2019

m=120; numerical_approx(sum(1/fibonacci(k) for k in (1..10*m)), digits=m) # G. C. Greubel, Feb 20 2019

Alternating series representation: 3 + Sum_{k >= 1} (-1)^(k+1)/(F(k)*F(k+1)*F(k+2)). - Peter Bala, Nov 30 2013
From Amiram Eldar, Oct 04 2020: (Start)
Equals sqrt(5) * Sum_{k>=0} (1/(phi^(2*k+1) - 1) - 2*phi^(2*k+1)/(phi^(4*(2*k+1)) - 1)), where phi is the golden ratio (A001622) (Greig, 1977).
Equals sqrt(5) * Sum_{k>=0} (-1)^k/(phi^(2*k+1) - (-1)^k) (Griffin, 1992).
Equals A153386 + A153387. (End)
From Gleb Koloskov, Sep 14 2021: (Start)
Equals 1 + c1*(c2 + 32*Integral_{x=0..infinity} f(x) dx),
where c1 = sqrt(5)/(8*log(phi)) = A002163/(8*A002390),
      c2 = 2*arctan(2)+log(5) = 2*A105199+A016628,
      phi = (1+sqrt(5))/2 = A001622,
f(x) = sin(x)*(4+cos(2*x))/((exp(Pi*x/log(phi))-1)*(2*cos(2*x)+3)*(7-2*cos(2*x))) (End)
From Amiram Eldar, Jan 27 2022: (Start)
Equals 3 + 2 * Sum_{k>=1} 1/(F(2*k-1)*F(2*k+1)*F(2*k+2)) (Bruckman, 1987).
Equals 2 + Sum_{k>=1} 1/A350901(k) (André-Jeannin, Problem H-450, 1991).
Equals lim_{n->oo} A350903(n)/(A350904(n)*A350902(n)) (André-Jeannin, 1991). (End)
Equals sqrt(5/4)*Sum_{j>=1} i^(1-j)/sin(j*c) where c = Pi/2 + i*arccsch(2). - Peter Luschny, Nov 15 2023
Equals lim_{n->oo} A203006(n)/A003266(n) (Z.W. M. Trzaska, 1996). - Raul Prisacariu, Sep 04 2024

A010476 Decimal expansion of square root of 20.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

Continued fraction expansion is 4 followed by {2, 8} repeated. - Harry J. Smith, Jun 03 2009

			4.472135954999579392818347337462552470881236719223051448541794490821041....

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

Except for offset, same as A020762.
Cf. A040015 (continued fraction). - Harry J. Smith, Jun 03 2009
Cf. A002163 (decimal expansion of square root of 5).

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

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

sqrt(20) = 2*sqrt(5). - Alonso del Arte, Jun 26 2015

Equals Sum_{k>=0} binomial(2*k,k) * k/5^k. - Amiram Eldar, Aug 03 2020

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)

A175380 Decimal expansion of Gamma(1/5).

Original entry on oeis.org

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

Offset: 1

R. J. Mathar, Apr 24 2010

			Equals 4.590843711998803053204758275929152...

G. C. Greubel, Table of n, a(n) for n = 1..5000
R. Vidunas, Expressions for values of the Gamma function, arxiv:math/0403510 [math.CA], 2004.
Wikipedia, Particular values of the Gamma function: General rational arguments
Index to sequences related to the gamma function

SetDefaultRealField(RealField(100)); Gamma(1/5); // G. C. Greubel, Mar 10 2018

Maple
```
evalf(GAMMA(1/5));
```

RealDigits[Gamma[1/5],10,120][[1]] (* Harvey P. Dale, May 26 2011 *)

gamma(1/5) \\ G. C. Greubel, Jan 15 2017

Equals Pi * sqrt(2) * sqrt(5 + sqrt(5)) / (sqrt(5) * Gamma(4/5) ) = A063448 * sqrt(5 + A002163) / (A002163 * Gamma(4/5)) where Gamma(4/5) = A340722.

A019887 Decimal expansion of sine of 78 degrees.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane

Equals sin(13*Pi/30). - Wesley Ivan Hurt, Aug 31 2014

A quartic number with denominator 2 and minimal polynomial 16x^4 + 8x^3 - 16x^2 - 8x + 1. - Charles R Greathouse IV, Aug 27 2017

			0.9781476007338056379285667478695995324597378088626771078851...

Ivan Panchenko, Table of n, a(n) for n = 0..1000
Wikipedia, Exact trigonometric constants
Index entries for algebraic numbers, degree 4

Digits:=100: evalf(sin(13*Pi/30)); # Wesley Ivan Hurt, Aug 31 2014

First@RealDigits[Sin[78 Degree], 10, 120] (* Michael De Vlieger, Aug 31 2014 *)

cos(Pi/15) \\ Charles R Greathouse IV, Aug 27 2017

Equals cos(Pi/15) = [sqrt(5)-1]*[1+sqrt(3)*sqrt{5+2*sqrt(5)}]/8 = [A002163-1]*[1+A002194*A019970]/8. - R. J. Mathar, Jun 18 2006
Equals 2*A019848*A019860. - R. J. Mathar, Jan 17 2021
4*this^3 -3*this = A019863. - R. J. Mathar, Aug 29 2025
Equals 2F1(-1/10,1/10 ; 1/2 ; 3/4). - R. J. Mathar, Aug 31 2025
A root of 16*x^4+8*x^3-16*x^2-8*x+1=0. - R. J. Mathar, Aug 31 2025

A010499 Decimal expansion of square root of 45.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane

Continued fraction expansion is 6 followed by {1, 2, 2, 2, 1, 12} repeated (A010135). - Harry J. Smith, Jun 06 2009

			6.708203932499369089227521006193828706321855078834577172812691736231562...

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

Cf. A010135 (continued fraction), A248271 (Egyptian fractions).

Cf. A020802 (reciprocal), A002163, A001622.

RealDigits[N[Sqrt[45],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 24 2011 *)

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

Equals 3 * A002163. - Amiram Eldar, May 25 2023
From Andrea Pinos, Nov 01 2023: (Start)
Equals phi^4 - 1/phi^4 where phi = A001622 is the golden ratio.
Equals 2*sinh(4*log(phi)). (End)

Showing 1-10 of 160 results. Next

cp's OEIS Frontend

A248235 Egyptian fraction representation of sqrt(5) (A002163) using a greedy function.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A001622 Decimal expansion of golden ratio phi (or tau) = (1 + sqrt(5))/2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A195284 Decimal expansion of shortest length of segment from side AB through incenter to side AC in right triangle ABC with sidelengths (a,b,c)=(3,4,5); i.e., decimal expansion of 2*sqrt(10)/3.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A098317 Decimal expansion of phi^3 = 2 + sqrt(5).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A079586 Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045(k).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Sage

Formula

A010476 Decimal expansion of square root of 20.

Views

Author

Keywords

Comments

Examples