4870849

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=32A000211
• A nonlinear recurrence: a(0) = 1, a(1) = 5, a(n) = a(n-1)^2 - 4*a(n-1) + 4 for n>1.at n=5A000324
• Squares of Lucas numbers.at n=16A001254
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=32A001638
• Number of restricted circular combinations.at n=30A006499
• Squares of odd Lucas numbers.at n=10A014730
• Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=32A048162
• 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=12A055812
• a(n) = Lucas(n) + (-1)^n + 1.at n=31A068397
• a(n) = L(n)*C(n), L(n)=Lucas numbers (A000032), C(n)=reflected Lucas numbers (see comment to A061084).at n=16A075150
• a(n) = Lucas(4n)+2 = Lucas(2n)^2.at n=8A081069
• a(n) = Fibonacci(2*n+1) + Fibonacci(2*n-1) + 2.at n=16A092387
• P_n(k) with P_0(z) = z+1 and P_n(z) = z + P_(n-1)(z)*(P_(n-1)(z)-z) for n>1; square array P_n(k), n>=0, k>=0, read by antidiagonals.at n=40A177888
• Squares that are the sum of three positive Fibonacci numbers.at n=33A179334
• Duplicate of A092387.at n=16A240926
• a(n) = P_n(n) with P_0(z) = z+1 and P_n(z) = z + P_{n-1}(z)*(P_{n-1}(z)-z) for n>1.at n=4A252730
• Number of non-attacking bishop positions on a cylindrical 2 X 2n chessboard.at n=8A286810
• Squares whose second arithmetic derivative is a square.at n=22A348425