1860496

Appears in sequences

• Squares of Lucas numbers.at n=15A001254
• Associated Mersenne numbers.at n=30A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=30A001638
• Alternate Lucas numbers - 2.at n=15A004146
• Number of restricted circular combinations.at n=28A006499
• Squares of even Lucas numbers.at n=5A014731
• Expansion of (1+x^2)/(1-2*x+x^3).at n=28A014739
• Cyclotomic polynomials Phi_n at x=phi, floored down (where phi = tau = (sqrt(5)+1)/2).at n=29A063703
• Cyclotomic polynomials Phi_n at x=phi, rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=29A063705
• a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=29A074392
• a(n) = Lucas(4*n+2)-2 = Lucas(2*n+1)^2.at n=7A081071
• a(n) is the number of images of the border correlation function for binary words of length n (cf. link).at n=29A091838
• a(2n) = Lucas(2n+3)^2, a(2n+1) = Lucas(2n+1)^2.at n=12A105671
• a(2n) = Lucas(2n+3)^2, a(2n+1) = Lucas(2n+1)^2.at n=15A105671
• a(n) = Product_{k=1..n} (1 + 4*sin(2*Pi*k/n)^2).at n=15A152152
• Logarithmic derivative of the squares of the Fibonacci numbers (A007598, with offset).at n=14A173661
• a(n) = -4 + 5*Fibonacci(n+1)^2.at n=14A200408
• Number of nX7 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=8A208012
• 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=17A221076
• 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=29A221364