5702887

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=17A001906
• 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=34A005013
• a(n) = F(F(n)), where F is a Fibonacci number.at n=9A007570
• Odd Fibonacci numbers.at n=22A014437
• Pisot sequence E(2,3).at n=31A020695
• Pisot sequences E(3,5), P(3,5).at n=30A020701
• Pisot sequences E(5,8), P(5,8).at n=29A020712
• a(n) = Fibonacci(3*n + 1).at n=11A033887
• a(n) = Fibonacci(4*n + 2).at n=8A033890
• Fibonacci numbers having initial digit '5'.at n=3A045729
• a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.at n=32A052952
• 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=33A052959
• Fibonacci numbers which are semiprimes.at n=8A053409
• Squarefree Fibonacci numbers.at n=27A061305
• Fibonacci numbers whose digits sum to a prime.at n=16A065398
• Fibonacci numbers whose sum of decimal digits is greater than its index.at n=11A068498
• Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.at n=12A068500
• Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.at n=33A069110
• Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k equals n.at n=31A071679
• Smallest Fibonacci number containing exactly n 8's.at n=1A072315