20365011074
domain: N
Appears in sequences
- a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=26A001519
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=17A014445
- Smallest Fibonacci number beginning with n.at n=20A020345
- a(n) = Fibonacci(4*n+3).at n=12A033891
- Fibonacci numbers having initial digit '2'.at n=9A045726
- Pisot sequences L(2,5), E(2,5).at n=24A048575
- Fibonacci numbers whose digits sum to a prime.at n=22A065398
- Smallest Fibonacci number containing exactly n 0's.at n=2A072323
- Squarefree Fibonacci numbers with odd number of prime factors.at n=23A074691
- Fibonacci numbers F(k) when k is a product of an even number of distinct primes A030229 (mu(k)=1).at n=14A075734
- Squarefree Fibonacci numbers whose indices are also squarefree.at n=28A075738
- Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).at n=25A079936
- a(n) = Fibonacci(5*n+1).at n=10A099100
- Smallest m such that 0 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=9A105711
- Smallest m such that 2 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=10A105712
- Smallest m such that 3 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=8A105713
- If a(n-1) is the i-th Fibonacci number then a(n)=Fibonacci(i+a(n-2)); with a(1)=1, a(2)=2 and where we use the following nonstandard indexing for the Fibonacci numbers: f(n)=f(n-1)+f(n-2), f(1)=1, f(2)=2 (cf. A000045).at n=6A112866
- a(2n) = A014445(n), a(2n+1) = A015448(n+1).at n=34A117647
- a(n) = A000045(A003622(n)).at n=19A117722
- Fibonacci numbers for which the sum of the digits is a Lucas number.at n=8A117766