832039

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=29A000071
• Fibonacci(n) - (-1)^n.at n=29A007492
• Pisot sequence T(4,7).at n=25A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=14A035508
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=29A051258
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=29A063704
• Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=29A063706
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=28A070964
• a(n) = Fibonacci(4n+2) - 1, or Fibonacci(2n)*Lucas(2n+2).at n=7A081008
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=28A100888
• a(n) = a(n-1) + a(n-3) + a(n-4).at n=29A115008
• a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.at n=14A128533
• First differences of A160794.at n=55A160795
• First differences of A116697.at n=28A186679
• a(n) = Fibonacci(2*n) - (n mod 2).at n=14A192068
• Number of tilings of an n X 1 rectangle (using tiles of dimension 1 X 1 and 2 X 1) that are not the concatenation of smaller equally-sized tilings.at n=28A224918
• Number of aperiodic tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1.at n=28A225202
• Number of compositions of n into parts 1 and 2 with both parts present.at n=26A245738
• Number of compositions (ordered partitions) of n into parts that do not divide n.at n=31A300702
• Numbers with equal counts of 1's and 0's in both their binary and Zeckendorf representations.at n=15A327911