14930351

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=35A000071
• a(n) = 7*a(n-1) - a(n-2) + 5.at n=8A003481
• Fibonacci(n) - (-1)^n.at n=35A007492
• Pisot sequence T(4,7).at n=31A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=17A035508
• a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).at n=8A081006
• Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).at n=34A100888
• Three consecutive elements of the sequence built from a quadratic form over four consecutive Fibonacci numbers A000045.at n=13A114695
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=19A128535
• a(n) = Sum_{i=1..F(n)} F(i), where F = A000045, Fibonacci numbers.at n=9A158569
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=29A164462
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=35A236144
• 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=33A239740
• Number of compositions of n into parts 1 and 2 with both parts present.at n=32A245738
• Number of compositions (ordered partitions) of n into parts that do not divide n.at n=37A300702
• Integers m such that m and m+1 are terms of A111035.at n=24A331977
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=34A333599
• Number of relatively prime compositions of n with no 1's.at n=37A337450