710649

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=28A000211
• Squares of Lucas numbers.at n=14A001254
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=28A001638
• Number of restricted circular combinations.at n=26A006499
• Squares of odd Lucas numbers.at n=9A014730
• Squares with initial digit '7'.at n=32A045791
• Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=28A048162
• a(n) and floor(a(n)/5) are both squares; i.e., squares which remain squares when written in base 5 and last digit is removed.at n=11A055812
• a(n) = Lucas(n) + (-1)^n + 1.at n=27A068397
• a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).at n=14A075150
• a(n) = Lucas(4n)+2 = Lucas(2n)^2.at n=7A081069
• a(1) = 1, then least square such that every partial concatenation is a prime.at n=26A090257
• a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.at n=14A092387
• Duplicate of A068397.at n=27A102081
• Inverse Moebius transform of Lucas numbers (A000032).at n=28A108031
• a(1) = 1; a(n) is the smallest square > 2*a(n-1).at n=17A175627
• Squares that are the sum of three positive Fibonacci numbers.at n=30A179334
• Number of ways to place k non-attacking knights on a 2 X n horizontal cylinder, summed over all k>=0.at n=13A201222
• Duplicate of A092387.at n=14A240926
• Number of non-attacking bishop positions on a cylindrical 2 X 2n chessboard.at n=7A286810