[go: up one dir, main page]

login
Revision History for A219010 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numerators in a product expansion for sqrt(5).
(history; published version)
#25 by Joerg Arndt at Wed Aug 02 04:51:14 EDT 2017
STATUS

reviewed

approved

#24 by Michel Marcus at Wed Aug 02 04:38:15 EDT 2017
STATUS

proposed

reviewed

#23 by Michael De Vlieger at Sun Jul 30 20:21:35 EDT 2017
STATUS

editing

proposed

#22 by Michael De Vlieger at Sun Jul 30 20:20:49 EDT 2017
MATHEMATICA

Table[(1 + 5*(Fibonacci[5^n] Fibonacci[5^n + 1] + Fibonacci[5^n - 1]^2))/2, {n, 0, 3}] (* or *)

Table[LucasL[2*5^n], {n, 0, 3}] (* Michael De Vlieger, Jul 30 2017 *)

STATUS

reviewed

editing

#21 by Michel Marcus at Sun Jul 30 02:22:26 EDT 2017
STATUS

proposed

reviewed

#20 by Jon E. Schoenfield at Sat Jul 29 22:22:21 EDT 2017
STATUS

editing

proposed

#19 by Jon E. Schoenfield at Sat Jul 29 22:22:17 EDT 2017
COMMENTS

Iterating the algebraic identity sqrt(1 + 4/x) = (1 + 2*(x + 2)/(x^2 + 3*x + 1)) * sqrt(1 + 4/(x*(x^2 + 5*x + 5)^2)) produces the rapidly converging product expansion sqrt(1 + 4/x) = product Product_{n = 0..inf} (1 + 2*a(n)/b(n)), where a(n) and b(n) are integer sequences when x is an integer: a(n) satisfies the recurrence a(n+1) = a(n)^5 - 5*a(n)^3 + 5*a(n) with the initial condition a(0) = x + 2 and b(n) satisfies the recurrence b(n+1) = 5/2*(b(n)^4 - b(n)^2)*sqrt(4*b(n) + 5) + b(n)^5 + 15/2*b(n)^4 - 25/2*b(n)^2 + 5 with the initial condition b(0) = x^2 + 3*x + 1.

FORMULA

a(n) = (1/2)*{(1 + 5*(Fibonacci(5^n)*Fibonacci(5^n + 1) + (Fibonacci(5^n - 1))^2)}).

STATUS

proposed

editing

#18 by Ehren Metcalfe at Sat Jul 29 00:47:28 EDT 2017
STATUS

editing

proposed

#17 by Ehren Metcalfe at Sat Jul 29 00:45:42 EDT 2017
FORMULA

a(n) = Lucas(2*5^n). - Ehren Metcalfe, Jul 29 2017

STATUS

approved

editing

#16 by Joerg Arndt at Sun May 14 12:56:53 EDT 2017
STATUS

reviewed

approved