33385284

Appears in sequences

• Squares of Lucas numbers.at n=18A001254
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=36A001638
• Number of restricted circular combinations.at n=34A006499
• Number of cyclic binary n-bit strings with no alternating substring of length > 2.at n=35A007039
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=35A007040
• Squares of even Lucas numbers.at n=6A014731
• Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=36A048162
• 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=14A055812
• a(n) = Lucas(n) + (-1)^n + 1.at n=35A068397
• a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).at n=18A075150
• a(n) = Lucas(4n)+2 = Lucas(2n)^2.at n=9A081069
• a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.at n=18A092387
• Inverse Moebius transform of Lucas numbers (A000032).at n=36A108031
• Squares that are the sum of three positive Fibonacci numbers.at n=36A179334
• Number of ways to place k non-attacking knights on a 2 X n horizontal cylinder, summed over all k>=0.at n=17A201222
• Duplicate of A092387.at n=18A240926
• Number of non-attacking bishop positions on a cylindrical 2 X 2n chessboard.at n=9A286810