832040

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=15A001906
• 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=30A005013
• Degree of variety K_{2,n}^5.at n=2A013702
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=10A014445
• Pisot sequence E(2,3).at n=27A020695
• Pisot sequences E(3,5), P(3,5).at n=26A020701
• Pisot sequences E(5,8), P(5,8).at n=25A020712
• a(n) = Fibonacci(4*n + 2).at n=7A033890
• Values of k for which there are no empty intervals when fractional part(m*phi) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=32A036415
• Fibonacci numbers having initial digit '8'.at n=2A045732
• Smallest positive Fibonacci number divisible by n.at n=30A047930
• Smallest positive Fibonacci number divisible by n.at n=21A047930
• Smallest positive Fibonacci number divisible by n.at n=19A047930
• Smallest positive Fibonacci number divisible by n.at n=39A047930
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=22A050762
• Smallest Fibonacci number that is divisible by n-th prime.at n=10A051694
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=28A052952
• 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=29A052959
• Smallest Fibonacci number with n distinct prime factors.at n=5A060319
• Erroneous version of A051694.at n=10A060321