1134903170
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=23A001519
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=15A014445
- Smallest Fibonacci number beginning with n.at n=11A020345
- a(n) = Fibonacci(4*n + 1).at n=11A033889
- Fibonacci numbers having initial digit '1'.at n=12A045725
- Pisot sequences L(2,5), E(2,5).at n=21A048575
- a(n) is the n-th term in sequence A_n, respecting the offset, or a(n) = -1 if A_n has fewer than n terms.at n=44A051070
- Squarefree Fibonacci numbers.at n=36A061305
- Fibonacci numbers whose digits sum to a prime.at n=20A065398
- Smallest n-digit Fibonacci number.at n=9A072351
- Squarefree Fibonacci numbers with odd number of prime factors.at n=19A074691
- Fibonacci numbers F(k) for k not squarefree (A013929).at n=15A075732
- Smallest Fibonacci numbers having exactly n Fibonacci divisors.at n=5A076985
- Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).at n=23A079936
- a(n) = Fibonacci(binomial(n+2,2)).at n=8A081667
- Nonprime Fibonacci numbers.at n=35A090206
- a(n) = (-1)^n * Fibonacci(2*n+1).at n=22A099496
- a(n) = Fibonacci(5*n).at n=9A102312
- Fibonacci numbers with nonprime indices.at n=31A103736
- Smallest m such that 3 is at the n-th position of the decimal representation of the m-th Fibonacci number.at n=3A105713