439203

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=26A001610
• Number of restricted circular combinations.at n=25A006499
• a(n) = Lucas(4n+3) - 1, or Lucas(2n+1)*Lucas(2n+2).at n=6A081019
• a(n) = Lucas(n) + (-1)^n.at n=27A099925
• a(n) = Lucas(3*n) - 1.at n=9A100233
• Antidiagonal sums of a triangle of coefficients of recurrences of the Fibonacci sequence.at n=52A138123
• Odd numbers in A138123.at n=25A142248
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*Lucas(n)) ), where Lucas(n) = A000032(n) = ((1+sqrt(5))/2)^n + ((1-sqrt(5))/2)^n.at n=38A174505
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A014448(n)) ), where A014448(n) = (2+sqrt(5))^n + (2-sqrt(5))^n.at n=13A174506
• Numbers k that have 13 terms in their Zeckendorf representation.at n=26A179253
• Position of first occurrence of n in A182576.at n=25A182580
• a(n) = L(n)*L(n+1), where L = A000032 (Lucas numbers).at n=13A215602
• Expansion of x*(1 + 2*x)/((1 - x)*(1 + x)*(1 - x - x^2)).at n=26A301653
• Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements.at n=27A324015