2178308

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=31A000071
• a(n) = 7*a(n-1) - a(n-2) + 5.at n=7A003481
• Fibonacci(n) - (-1)^n.at n=31A007492
• Pisot sequence T(4,7).at n=27A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=15A035508
• Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=31A051258
• Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=31A063704
• 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=31A063706
• a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=30A070964
• a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).at n=7A081006
• a(n) = Fibonacci(n) - (Fibonacci(n) mod 2).at n=32A104221
• a(n) = Fibonacci((prime(n)+3)/2) - 1.at n=16A121569
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=17A128535
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=25A164462
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j).at n=30A205454
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j).at n=43A205454
• 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=30A224918
• Number of aperiodic tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1.at n=30A225202
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=31A236144
• a(n) = gcd(Sum_{k=1...n} F(k), Product{j=1...n} F(j)), where F(k) is the k-th Fibonacci number.at n=29A239740