2178309

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=16A001906
• a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=32A005013
• Odd Fibonacci numbers.at n=21A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=11A015448
• Pisot sequence E(2,3).at n=29A020695
• Pisot sequences E(3,5), P(3,5).at n=28A020701
• Pisot sequences E(5,8), P(5,8).at n=27A020712
• a(n) = Fibonacci(4*n).at n=8A033888
• Fibonacci numbers having initial digit '2'.at n=5A045726
• Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).at n=15A050611
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=30A050613
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=31A050613
• Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).at n=15A050614
• Products of distinct terms of Fibonacci(2^(i+2)): a(n) = Product_{i=0..floor(log_2(n+1))} F(2^(i+2))^bit(n,i).at n=8A050615
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=24A050762
• a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.at n=31A051348
• a(n) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2*i).at n=16A051656
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=30A052952
• a(2n) = a(2n-1)+a(2n-2), a(2n+1) = a(2n)+a(2n-1)-1, a(0)=2, a(1)=1.at n=31A052959
• a(n) = Fibonacci(2^n).at n=5A058635