102334154

Appears in sequences

• a(n) = Fibonacci(n) - 1.at n=39A000071
• a(n) = 7*a(n-1) - a(n-2) + 5.at n=9A003481
• Pisot sequence T(4,7).at n=35A020732
• a(n) = Fibonacci(2*n+2) - 1.at n=19A035508
• a(n) = Fibonacci(4n) - 1, or Fibonacci(2n+1)*Lucas(2n-1).at n=9A081006
• a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=21A128535
• Number of binary strings of length n with no substrings equal to 0001 0010 or 0110.at n=33A164447
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0101.at n=33A164462
• a(n) = F(floor( (n+3)/2 )) * L(floor( (n+2)/2 )) where F=Fibonacci and L=Lucas numbers.at n=39A236144
• 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=37A239740
• Number of compositions of n into parts 1 and 2 with both parts present.at n=36A245738
• Number of compositions (ordered partitions) of n into parts that do not divide n.at n=41A300702
• a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).at n=38A333599