10749957120
domain: N
Appears in sequences
- Alternate Lucas numbers - 2.at n=24A004146
- Lucas(4n)-2, or 5*Fibonacci(2n)^2.at n=12A081070
- (2 + phi)/a(n) is the sum of successive remainders when computing the Euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio, where n >= 2.at n=10A087954
- a(n) = 5*Fibonacci(n)^2.at n=23A099921
- Partial sums of A215602.at n=23A215580
- Continued fraction expansion of product_{n>=0} (1-sqrt(5)*[sqrt(5)-2]^{4n+3})/(1-sqrt(5)*[sqrt(5)-2]^{4n+1}).at n=29A221076
- The simple continued fraction expansion of F(x) := Product_{n >= 0} (1 - x^(4*n+3))/(1 - x^(4*n+1)) when x = 1/2*(3 - sqrt(5)).at n=47A221364
- The simple continued fraction expansion of F(x) := Product_{n >= 0} (1 - x^(4*n+3))/(1 - x^(4*n+1)) when x = (1/2)*(7 - 3*sqrt(5)).at n=23A221366
- Incorrect duplicate of A004146.at n=23A275571
- Number of odd chordless cycles in the 2n-Moebius ladder graph.at n=24A301773